/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:19:22,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:19:22,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:19:22,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:19:22,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:19:22,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:19:22,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:19:22,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:19:22,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:19:22,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:19:22,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:19:22,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:19:22,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:19:22,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:19:22,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:19:22,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:19:22,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:19:22,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:19:22,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:19:22,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:19:22,062 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:19:22,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:19:22,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:19:22,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:19:22,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:19:22,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:19:22,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:19:22,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:19:22,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:19:22,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:19:22,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:19:22,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:19:22,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:19:22,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:19:22,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:19:22,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:19:22,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:19:22,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:19:22,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:19:22,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:19:22,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:19:22,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:19:22,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:19:22,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:19:22,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:19:22,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:19:22,101 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:19:22,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:19:22,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:19:22,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:19:22,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:19:22,102 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:19:22,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:19:22,103 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:19:22,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:19:22,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:19:22,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:19:22,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:19:22,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:19:22,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:19:22,104 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:19:22,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:19:22,104 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:19:22,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:19:22,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:19:22,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:19:22,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:19:22,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:22,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:19:22,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:19:22,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:19:22,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:19:22,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:19:22,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:19:22,284 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:19:22,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2022-04-27 10:19:22,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337cd2147/86d17b05679e44f0ac6f793ee757ea04/FLAG1325e5781 [2022-04-27 10:19:22,731 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:19:22,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2022-04-27 10:19:22,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337cd2147/86d17b05679e44f0ac6f793ee757ea04/FLAG1325e5781 [2022-04-27 10:19:22,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337cd2147/86d17b05679e44f0ac6f793ee757ea04 [2022-04-27 10:19:22,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:19:22,746 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:19:22,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:22,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:19:22,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:19:22,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d962981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22, skipping insertion in model container [2022-04-27 10:19:22,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:19:22,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:19:22,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i[808,821] [2022-04-27 10:19:22,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:22,929 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:19:22,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i[808,821] [2022-04-27 10:19:22,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:22,948 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:19:22,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22 WrapperNode [2022-04-27 10:19:22,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:22,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:19:22,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:19:22,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:19:22,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:19:22,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:19:22,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:19:22,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:19:22,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (1/1) ... [2022-04-27 10:19:22,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:22,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:23,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:19:23,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:19:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:19:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:19:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:19:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:19:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:19:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:19:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:19:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:19:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:19:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:19:23,092 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:19:23,093 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:19:23,170 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:19:23,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:19:23,174 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:19:23,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:23 BoogieIcfgContainer [2022-04-27 10:19:23,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:19:23,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:19:23,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:19:23,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:19:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:19:22" (1/3) ... [2022-04-27 10:19:23,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4209ff77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:23, skipping insertion in model container [2022-04-27 10:19:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:22" (2/3) ... [2022-04-27 10:19:23,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4209ff77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:23, skipping insertion in model container [2022-04-27 10:19:23,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:23" (3/3) ... [2022-04-27 10:19:23,180 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2022-04-27 10:19:23,189 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:19:23,189 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:19:23,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:19:23,227 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@541b3aa3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e8dc065 [2022-04-27 10:19:23,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:19:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:19:23,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:23,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:23,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:23,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-27 10:19:23,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:23,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543811210] [2022-04-27 10:19:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:23,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:23,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:23,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-27 10:19:23,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:23,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-27 10:19:23,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:23,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-27 10:19:23,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:23,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-27 10:19:23,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-27 10:19:23,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-27 10:19:23,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-27 10:19:23,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-27 10:19:23,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 10:19:23,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:19:23,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:19:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:23,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543811210] [2022-04-27 10:19:23,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543811210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:23,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:23,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:19:23,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822936855] [2022-04-27 10:19:23,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:23,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:23,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:23,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:19:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:23,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:19:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:19:23,444 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:23,498 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 10:19:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:19:23,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 10:19:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 10:19:23,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 10:19:23,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:23,578 INFO L225 Difference]: With dead ends: 31 [2022-04-27 10:19:23,578 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 10:19:23,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:19:23,582 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:23,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 10:19:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 10:19:23,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:23,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,602 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,602 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:23,604 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 10:19:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:19:23,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:23,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:23,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:19:23,605 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:19:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:23,607 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 10:19:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:19:23,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:23,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:23,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:23,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 10:19:23,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 10:19:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:23,610 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 10:19:23,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:19:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:19:23,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:23,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:23,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:19:23,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-27 10:19:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:23,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099640896] [2022-04-27 10:19:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:23,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:23,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {120#true} is VALID [2022-04-27 10:19:23,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 10:19:23,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} #47#return; {120#true} is VALID [2022-04-27 10:19:23,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:23,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {120#true} is VALID [2022-04-27 10:19:23,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 10:19:23,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #47#return; {120#true} is VALID [2022-04-27 10:19:23,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret3 := main(); {120#true} is VALID [2022-04-27 10:19:23,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:23,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:23,688 INFO L272 TraceCheckUtils]: 7: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:23,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {127#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:23,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {127#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {121#false} is VALID [2022-04-27 10:19:23,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-04-27 10:19:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:23,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099640896] [2022-04-27 10:19:23,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099640896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:23,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:23,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:19:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905187949] [2022-04-27 10:19:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:23,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:23,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:23,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:23,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:19:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:23,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:19:23,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:23,710 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:23,836 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:19:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:19:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 10:19:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 10:19:23,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 10:19:23,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:23,866 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:19:23,867 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:19:23,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:19:23,871 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:23,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:19:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:19:23,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:23,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,877 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,878 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:23,879 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:19:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:19:23,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:23,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:23,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:19:23,881 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:19:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:23,883 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:19:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:19:23,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:23,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:23,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:23,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 10:19:23,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 10:19:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:23,887 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 10:19:23,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:19:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:19:23,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:23,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:23,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:19:23,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-27 10:19:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:23,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343391069] [2022-04-27 10:19:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:24,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {228#true} is VALID [2022-04-27 10:19:24,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 10:19:24,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #47#return; {228#true} is VALID [2022-04-27 10:19:24,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:24,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {228#true} is VALID [2022-04-27 10:19:24,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 10:19:24,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #47#return; {228#true} is VALID [2022-04-27 10:19:24,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret3 := main(); {228#true} is VALID [2022-04-27 10:19:24,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:24,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:24,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {235#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-27 10:19:24,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {236#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:24,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {237#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:24,057 INFO L272 TraceCheckUtils]: 10: Hoare triple {237#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:24,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {238#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:24,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {229#false} is VALID [2022-04-27 10:19:24,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 10:19:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:24,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343391069] [2022-04-27 10:19:24,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343391069] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:24,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365215549] [2022-04-27 10:19:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:24,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:24,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:19:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:24,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:19:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:24,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:24,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-27 10:19:24,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {228#true} is VALID [2022-04-27 10:19:24,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 10:19:24,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #47#return; {228#true} is VALID [2022-04-27 10:19:24,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret3 := main(); {228#true} is VALID [2022-04-27 10:19:24,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:24,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:24,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {265#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 10:19:24,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {269#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 10:19:24,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} assume !(~i~0 <= ~n~0); {273#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 10:19:24,338 INFO L272 TraceCheckUtils]: 10: Hoare triple {273#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:24,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:24,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {229#false} is VALID [2022-04-27 10:19:24,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 10:19:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:24,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:24,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 10:19:24,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {229#false} is VALID [2022-04-27 10:19:24,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:24,566 INFO L272 TraceCheckUtils]: 10: Hoare triple {297#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:24,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {297#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:24,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {305#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {301#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:24,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {305#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:24,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0); {309#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:24,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {313#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:24,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret3 := main(); {228#true} is VALID [2022-04-27 10:19:24,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #47#return; {228#true} is VALID [2022-04-27 10:19:24,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 10:19:24,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {228#true} is VALID [2022-04-27 10:19:24,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-27 10:19:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:24,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365215549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:24,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:24,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-27 10:19:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251303654] [2022-04-27 10:19:24,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:24,580 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:19:24,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:24,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:24,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:24,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:19:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:19:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:19:24,599 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:25,088 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 10:19:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:19:25,089 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:19:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-27 10:19:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-27 10:19:25,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2022-04-27 10:19:25,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:25,136 INFO L225 Difference]: With dead ends: 37 [2022-04-27 10:19:25,136 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:19:25,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-04-27 10:19:25,138 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:25,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 81 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:19:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:19:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 10:19:25,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:25,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,143 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,143 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:25,144 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:19:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:19:25,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:25,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:25,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:19:25,145 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:19:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:25,146 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:19:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:19:25,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:25,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:25,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:25,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-27 10:19:25,147 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-27 10:19:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:25,147 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-27 10:19:25,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 10:19:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:19:25,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:25,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:25,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:25,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:25,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1107532713, now seen corresponding path program 2 times [2022-04-27 10:19:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:25,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751583569] [2022-04-27 10:19:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:25,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {485#true} is VALID [2022-04-27 10:19:25,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 10:19:25,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #47#return; {485#true} is VALID [2022-04-27 10:19:25,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {500#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:25,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {500#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {485#true} is VALID [2022-04-27 10:19:25,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 10:19:25,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #47#return; {485#true} is VALID [2022-04-27 10:19:25,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret3 := main(); {485#true} is VALID [2022-04-27 10:19:25,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:25,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:25,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:25,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 10:19:25,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0); {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 10:19:25,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {493#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:25,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 10:19:25,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {492#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0); {494#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} is VALID [2022-04-27 10:19:25,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {495#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:25,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {495#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {496#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:25,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {496#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {497#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:25,527 INFO L272 TraceCheckUtils]: 16: Hoare triple {497#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:25,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {498#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {499#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:25,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {486#false} is VALID [2022-04-27 10:19:25,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-04-27 10:19:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:19:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751583569] [2022-04-27 10:19:25,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751583569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737735763] [2022-04-27 10:19:25,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:19:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:25,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:25,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:19:25,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:19:25,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:19:25,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:19:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:25,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:25,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2022-04-27 10:19:25,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {485#true} is VALID [2022-04-27 10:19:25,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 10:19:25,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #47#return; {485#true} is VALID [2022-04-27 10:19:25,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret3 := main(); {485#true} is VALID [2022-04-27 10:19:25,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:25,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:25,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:25,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:25,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:25,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {535#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} is VALID [2022-04-27 10:19:26,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {539#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-27 10:19:26,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0); {543#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-27 10:19:26,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {547#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-27 10:19:26,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {547#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {551#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-27 10:19:26,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {555#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-27 10:19:26,006 INFO L272 TraceCheckUtils]: 16: Hoare triple {555#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:26,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:26,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {486#false} is VALID [2022-04-27 10:19:26,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-04-27 10:19:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:26,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:26,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-04-27 10:19:26,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {486#false} is VALID [2022-04-27 10:19:26,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:26,450 INFO L272 TraceCheckUtils]: 16: Hoare triple {579#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:26,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {583#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {579#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:26,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {587#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {583#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:26,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {591#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {587#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:26,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0); {591#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:26,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {595#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:26,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {599#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:26,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0); {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:26,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {603#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:26,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {610#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:26,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0); {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 10:19:26,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {614#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 10:19:26,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret3 := main(); {485#true} is VALID [2022-04-27 10:19:26,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #47#return; {485#true} is VALID [2022-04-27 10:19:26,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 10:19:26,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {485#true} is VALID [2022-04-27 10:19:26,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2022-04-27 10:19:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:26,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737735763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:26,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:26,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-04-27 10:19:26,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197408064] [2022-04-27 10:19:26,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:19:26,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:26,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:26,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:26,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 10:19:26,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 10:19:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2022-04-27 10:19:26,491 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:27,357 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-27 10:19:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 10:19:27,357 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:19:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-27 10:19:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-27 10:19:27,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 49 transitions. [2022-04-27 10:19:27,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:27,395 INFO L225 Difference]: With dead ends: 42 [2022-04-27 10:19:27,396 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:19:27,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:19:27,397 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:27,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 76 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:19:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:19:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-27 10:19:27,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:27,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,413 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,413 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:27,414 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 10:19:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 10:19:27,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:27,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:27,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 10:19:27,415 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 10:19:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:27,416 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 10:19:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 10:19:27,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:27,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:27,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:27,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-27 10:19:27,417 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2022-04-27 10:19:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:27,417 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-27 10:19:27,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:19:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 10:19:27,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:27,418 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:27,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:27,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:19:27,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1448012981, now seen corresponding path program 1 times [2022-04-27 10:19:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:27,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407251547] [2022-04-27 10:19:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:27,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {836#true} is VALID [2022-04-27 10:19:27,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 10:19:27,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {836#true} {836#true} #47#return; {836#true} is VALID [2022-04-27 10:19:27,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:27,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {836#true} is VALID [2022-04-27 10:19:27,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 10:19:27,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #47#return; {836#true} is VALID [2022-04-27 10:19:27,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret3 := main(); {836#true} is VALID [2022-04-27 10:19:27,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {841#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:27,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {841#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:27,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {841#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:27,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {842#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:27,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {842#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:27,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {842#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {842#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:27,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {843#(<= main_~i~0 3)} is VALID [2022-04-27 10:19:27,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {843#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {843#(<= main_~i~0 3)} is VALID [2022-04-27 10:19:27,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {843#(<= main_~i~0 3)} is VALID [2022-04-27 10:19:27,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {843#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {844#(<= main_~i~0 4)} is VALID [2022-04-27 10:19:27,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {844#(<= main_~i~0 4)} is VALID [2022-04-27 10:19:27,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {844#(<= main_~i~0 4)} is VALID [2022-04-27 10:19:27,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {844#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {845#(<= main_~i~0 5)} is VALID [2022-04-27 10:19:27,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {845#(<= main_~i~0 5)} is VALID [2022-04-27 10:19:27,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#(<= main_~i~0 5)} assume !(~i~0 < 10); {837#false} is VALID [2022-04-27 10:19:27,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {837#false} is VALID [2022-04-27 10:19:27,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#false} assume !(~i~0 <= ~n~0); {837#false} is VALID [2022-04-27 10:19:27,687 INFO L272 TraceCheckUtils]: 22: Hoare triple {837#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {837#false} is VALID [2022-04-27 10:19:27,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#false} ~cond := #in~cond; {837#false} is VALID [2022-04-27 10:19:27,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {837#false} assume 0 == ~cond; {837#false} is VALID [2022-04-27 10:19:27,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-27 10:19:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407251547] [2022-04-27 10:19:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407251547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869365185] [2022-04-27 10:19:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:27,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:27,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:27,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:27,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:19:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:27,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:19:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:27,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:27,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {836#true} is VALID [2022-04-27 10:19:27,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {836#true} is VALID [2022-04-27 10:19:27,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 10:19:27,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #47#return; {836#true} is VALID [2022-04-27 10:19:27,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret3 := main(); {836#true} is VALID [2022-04-27 10:19:27,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {865#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:27,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {865#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:27,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {865#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:27,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {842#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:27,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {842#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:27,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {842#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {842#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:27,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {843#(<= main_~i~0 3)} is VALID [2022-04-27 10:19:27,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {843#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {843#(<= main_~i~0 3)} is VALID [2022-04-27 10:19:27,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {843#(<= main_~i~0 3)} is VALID [2022-04-27 10:19:27,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {843#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {844#(<= main_~i~0 4)} is VALID [2022-04-27 10:19:27,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {844#(<= main_~i~0 4)} is VALID [2022-04-27 10:19:27,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {844#(<= main_~i~0 4)} is VALID [2022-04-27 10:19:27,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {844#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {845#(<= main_~i~0 5)} is VALID [2022-04-27 10:19:27,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {845#(<= main_~i~0 5)} is VALID [2022-04-27 10:19:27,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#(<= main_~i~0 5)} assume !(~i~0 < 10); {837#false} is VALID [2022-04-27 10:19:27,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {837#false} is VALID [2022-04-27 10:19:27,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#false} assume !(~i~0 <= ~n~0); {837#false} is VALID [2022-04-27 10:19:27,855 INFO L272 TraceCheckUtils]: 22: Hoare triple {837#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {837#false} is VALID [2022-04-27 10:19:27,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#false} ~cond := #in~cond; {837#false} is VALID [2022-04-27 10:19:27,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {837#false} assume 0 == ~cond; {837#false} is VALID [2022-04-27 10:19:27,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-27 10:19:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:27,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:27,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-27 10:19:27,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {837#false} assume 0 == ~cond; {837#false} is VALID [2022-04-27 10:19:27,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#false} ~cond := #in~cond; {837#false} is VALID [2022-04-27 10:19:27,975 INFO L272 TraceCheckUtils]: 22: Hoare triple {837#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {837#false} is VALID [2022-04-27 10:19:27,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#false} assume !(~i~0 <= ~n~0); {837#false} is VALID [2022-04-27 10:19:27,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {837#false} is VALID [2022-04-27 10:19:27,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#(< main_~i~0 10)} assume !(~i~0 < 10); {837#false} is VALID [2022-04-27 10:19:27,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {944#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {944#(< main_~i~0 10)} is VALID [2022-04-27 10:19:27,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {951#(< main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {944#(< main_~i~0 10)} is VALID [2022-04-27 10:19:27,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {951#(< main_~i~0 9)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {951#(< main_~i~0 9)} is VALID [2022-04-27 10:19:27,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#(< main_~i~0 9)} assume !!(~i~0 <= ~n~0); {951#(< main_~i~0 9)} is VALID [2022-04-27 10:19:27,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {961#(< main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {951#(< main_~i~0 9)} is VALID [2022-04-27 10:19:27,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {961#(< main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {961#(< main_~i~0 8)} is VALID [2022-04-27 10:19:27,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {961#(< main_~i~0 8)} assume !!(~i~0 <= ~n~0); {961#(< main_~i~0 8)} is VALID [2022-04-27 10:19:27,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {971#(< main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {961#(< main_~i~0 8)} is VALID [2022-04-27 10:19:27,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#(< main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {971#(< main_~i~0 7)} is VALID [2022-04-27 10:19:27,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#(< main_~i~0 7)} assume !!(~i~0 <= ~n~0); {971#(< main_~i~0 7)} is VALID [2022-04-27 10:19:27,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {971#(< main_~i~0 7)} is VALID [2022-04-27 10:19:27,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {845#(<= main_~i~0 5)} is VALID [2022-04-27 10:19:27,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {845#(<= main_~i~0 5)} is VALID [2022-04-27 10:19:27,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {845#(<= main_~i~0 5)} is VALID [2022-04-27 10:19:27,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret3 := main(); {836#true} is VALID [2022-04-27 10:19:27,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #47#return; {836#true} is VALID [2022-04-27 10:19:27,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 10:19:27,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {836#true} is VALID [2022-04-27 10:19:27,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {836#true} is VALID [2022-04-27 10:19:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:27,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869365185] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:27,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:27,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-27 10:19:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419724269] [2022-04-27 10:19:27,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:27,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 10:19:27,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:27,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:28,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 10:19:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 10:19:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:19:28,012 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:28,172 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 10:19:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:19:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 10:19:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 10:19:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-27 10:19:28,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-27 10:19:28,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:28,211 INFO L225 Difference]: With dead ends: 52 [2022-04-27 10:19:28,211 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 10:19:28,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:19:28,212 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:28,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 10:19:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-27 10:19:28,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:28,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,233 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,233 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:28,234 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-27 10:19:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-27 10:19:28,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:28,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:28,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-27 10:19:28,235 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-27 10:19:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:28,236 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-27 10:19:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-27 10:19:28,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:28,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:28,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:28,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-27 10:19:28,238 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 26 [2022-04-27 10:19:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:28,238 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-27 10:19:28,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-27 10:19:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 10:19:28,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:28,239 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:28,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:28,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:28,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash 486456110, now seen corresponding path program 2 times [2022-04-27 10:19:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:28,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454449891] [2022-04-27 10:19:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:28,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:19:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:28,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:19:28,504 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:19:28,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:19:28,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:19:28,507 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-27 10:19:28,509 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:19:28,525 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:19:28,526 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:19:28,526 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:19:28,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:28 BoogieIcfgContainer [2022-04-27 10:19:28,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:19:28,527 INFO L158 Benchmark]: Toolchain (without parser) took 5780.72ms. Allocated memory was 209.7MB in the beginning and 332.4MB in the end (delta: 122.7MB). Free memory was 153.4MB in the beginning and 247.9MB in the end (delta: -94.5MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. [2022-04-27 10:19:28,527 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:19:28,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.29ms. Allocated memory was 209.7MB in the beginning and 276.8MB in the end (delta: 67.1MB). Free memory was 153.2MB in the beginning and 248.2MB in the end (delta: -95.0MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-04-27 10:19:28,528 INFO L158 Benchmark]: Boogie Preprocessor took 27.74ms. Allocated memory is still 276.8MB. Free memory was 248.2MB in the beginning and 246.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:19:28,528 INFO L158 Benchmark]: RCFGBuilder took 197.71ms. Allocated memory is still 276.8MB. Free memory was 246.9MB in the beginning and 236.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:19:28,528 INFO L158 Benchmark]: TraceAbstraction took 5349.99ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 236.0MB in the beginning and 247.9MB in the end (delta: -12.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-04-27 10:19:28,529 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.29ms. Allocated memory was 209.7MB in the beginning and 276.8MB in the end (delta: 67.1MB). Free memory was 153.2MB in the beginning and 248.2MB in the end (delta: -95.0MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.74ms. Allocated memory is still 276.8MB. Free memory was 248.2MB in the beginning and 246.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 197.71ms. Allocated memory is still 276.8MB. Free memory was 246.9MB in the beginning and 236.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5349.99ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 236.0MB in the beginning and 247.9MB in the end (delta: -12.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 VAL [i=1, n=0, n=10] [L24] COND TRUE i<=n VAL [i=1, n=10, n=0] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=1, n=10, n=2] [L24] i++ VAL [i=2, n=10, n=2] [L24] COND TRUE i<=n VAL [i=2, n=10, n=2] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=2, n=4, n=10] [L24] i++ VAL [i=3, n=10, n=4] [L24] COND TRUE i<=n VAL [i=3, n=4, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=3, n=10, n=6] [L24] i++ VAL [i=4, n=6, n=10] [L24] COND TRUE i<=n VAL [i=4, n=10, n=6] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=4, n=10, n=8] [L24] i++ VAL [i=5, n=10, n=8] [L24] COND TRUE i<=n VAL [i=5, n=10, n=8] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=5, n=10, n=10] [L24] i++ VAL [i=6, n=10, n=10] [L24] COND TRUE i<=n VAL [i=6, n=10, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=6, n=10, n=12] [L24] i++ VAL [i=7, n=12, n=10] [L24] COND TRUE i<=n VAL [i=7, n=12, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=7, n=14, n=10] [L24] i++ VAL [i=8, n=10, n=14] [L24] COND TRUE i<=n VAL [i=8, n=14, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=8, n=16, n=10] [L24] i++ VAL [i=9, n=16, n=10] [L24] COND TRUE i<=n VAL [i=9, n=10, n=16] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=9, n=18, n=10] [L24] i++ VAL [i=10, n=18, n=10] [L24] COND TRUE i<=n VAL [i=10, n=18, n=10] [L25] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L24] i++ VAL [i=11, n=10, n=18] [L24] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 62 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=5, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1066 SizeOfPredicates, 6 NumberOfNonLiveVariables, 205 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 28/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 10:19:28,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...