/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:30:04,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:30:04,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:30:04,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:30:04,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:30:04,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:30:04,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:30:04,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:30:04,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:30:04,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:30:04,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:30:04,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:30:04,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:30:04,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:30:04,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:30:04,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:30:04,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:30:04,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:30:04,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:30:04,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:30:04,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:30:04,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:30:04,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:30:04,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:30:04,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:30:04,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:30:04,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:30:04,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:30:04,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:30:04,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:30:04,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:30:04,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:30:04,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:30:04,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:30:04,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:30:04,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:30:04,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:30:04,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:30:04,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:30:04,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:30:04,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:30:04,862 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 [2020-07-17 22:30:04,896 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:30:04,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:30:04,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:30:04,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:30:04,900 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:30:04,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:30:04,901 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:30:04,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:30:04,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:30:04,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:30:04,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:30:04,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:30:04,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:30:04,902 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:30:04,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:30:04,902 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:30:04,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:30:04,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:30:04,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:30:04,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:30:04,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:30:04,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:30:04,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:30:04,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:30:04,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:30:04,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:30:04,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:30:04,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:30:04,906 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:30:04,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:30:05,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:30:05,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:30:05,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:30:05,217 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:30:05,218 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:30:05,218 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22-2.c [2020-07-17 22:30:05,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6d1485a/dac904eb5f4446628b087be5245b0427/FLAG294229b21 [2020-07-17 22:30:05,732 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:30:05,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-2.c [2020-07-17 22:30:05,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6d1485a/dac904eb5f4446628b087be5245b0427/FLAG294229b21 [2020-07-17 22:30:06,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6d1485a/dac904eb5f4446628b087be5245b0427 [2020-07-17 22:30:06,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:30:06,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:30:06,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:30:06,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:30:06,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:30:06,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b184564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06, skipping insertion in model container [2020-07-17 22:30:06,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:30:06,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:30:06,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:30:06,444 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:30:06,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:30:06,590 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:30:06,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06 WrapperNode [2020-07-17 22:30:06,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:30:06,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:30:06,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:30:06,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:30:06,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... [2020-07-17 22:30:06,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:30:06,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:30:06,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:30:06,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:30:06,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:30:06,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:30:06,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:30:06,729 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-17 22:30:06,730 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-17 22:30:06,730 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-17 22:30:06,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:30:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:30:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:30:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-17 22:30:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-17 22:30:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:30:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-17 22:30:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-17 22:30:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:30:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:30:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:30:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:30:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-17 22:30:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:30:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:30:07,176 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:30:07,176 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:30:07,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:30:07 BoogieIcfgContainer [2020-07-17 22:30:07,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:30:07,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:30:07,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:30:07,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:30:07,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:30:06" (1/3) ... [2020-07-17 22:30:07,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f0a5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:30:07, skipping insertion in model container [2020-07-17 22:30:07,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:06" (2/3) ... [2020-07-17 22:30:07,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f0a5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:30:07, skipping insertion in model container [2020-07-17 22:30:07,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:30:07" (3/3) ... [2020-07-17 22:30:07,188 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-2.c [2020-07-17 22:30:07,198 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:30:07,206 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:30:07,219 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:30:07,238 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:30:07,238 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:30:07,238 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:30:07,238 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:30:07,238 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:30:07,239 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:30:07,239 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:30:07,239 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:30:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-17 22:30:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:30:07,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:07,262 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:07,262 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1345538594, now seen corresponding path program 1 times [2020-07-17 22:30:07,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:07,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356372014] [2020-07-17 22:30:07,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:07,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {39#true} is VALID [2020-07-17 22:30:07,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,633 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #71#return; {39#true} is VALID [2020-07-17 22:30:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:07,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {39#true} is VALID [2020-07-17 22:30:07,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,657 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #61#return; {39#true} is VALID [2020-07-17 22:30:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:07,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2020-07-17 22:30:07,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {39#true} is VALID [2020-07-17 22:30:07,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,676 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #63#return; {39#true} is VALID [2020-07-17 22:30:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:07,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2020-07-17 22:30:07,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {39#true} is VALID [2020-07-17 22:30:07,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,695 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #65#return; {39#true} is VALID [2020-07-17 22:30:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:07,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2020-07-17 22:30:07,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {39#true} is VALID [2020-07-17 22:30:07,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,717 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2020-07-17 22:30:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:07,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {39#true} is VALID [2020-07-17 22:30:07,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,741 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {40#false} #69#return; {40#false} is VALID [2020-07-17 22:30:07,746 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {62#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:30:07,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {39#true} is VALID [2020-07-17 22:30:07,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,748 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #71#return; {39#true} is VALID [2020-07-17 22:30:07,748 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret17 := main(); {39#true} is VALID [2020-07-17 22:30:07,750 INFO L263 TraceCheckUtils]: 5: Hoare triple {39#true} call init(); {63#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-17 22:30:07,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {63#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {39#true} is VALID [2020-07-17 22:30:07,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,751 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {39#true} {39#true} #61#return; {39#true} is VALID [2020-07-17 22:30:07,752 INFO L263 TraceCheckUtils]: 9: Hoare triple {39#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {39#true} is VALID [2020-07-17 22:30:07,752 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2020-07-17 22:30:07,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {39#true} is VALID [2020-07-17 22:30:07,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,754 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {39#true} {39#true} #63#return; {39#true} is VALID [2020-07-17 22:30:07,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {39#true} is VALID [2020-07-17 22:30:07,754 INFO L263 TraceCheckUtils]: 15: Hoare triple {39#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {39#true} is VALID [2020-07-17 22:30:07,755 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2020-07-17 22:30:07,755 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {39#true} is VALID [2020-07-17 22:30:07,755 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,756 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {39#true} {39#true} #65#return; {39#true} is VALID [2020-07-17 22:30:07,756 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {39#true} is VALID [2020-07-17 22:30:07,757 INFO L263 TraceCheckUtils]: 21: Hoare triple {39#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {39#true} is VALID [2020-07-17 22:30:07,757 INFO L280 TraceCheckUtils]: 22: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2020-07-17 22:30:07,758 INFO L280 TraceCheckUtils]: 23: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {39#true} is VALID [2020-07-17 22:30:07,758 INFO L280 TraceCheckUtils]: 24: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,759 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2020-07-17 22:30:07,759 INFO L280 TraceCheckUtils]: 26: Hoare triple {39#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {39#true} is VALID [2020-07-17 22:30:07,764 INFO L280 TraceCheckUtils]: 27: Hoare triple {39#true} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; {39#true} is VALID [2020-07-17 22:30:07,764 INFO L280 TraceCheckUtils]: 28: Hoare triple {39#true} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {39#true} is VALID [2020-07-17 22:30:07,766 INFO L280 TraceCheckUtils]: 29: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-17 22:30:07,766 INFO L263 TraceCheckUtils]: 30: Hoare triple {40#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {39#true} is VALID [2020-07-17 22:30:07,766 INFO L280 TraceCheckUtils]: 31: Hoare triple {39#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {39#true} is VALID [2020-07-17 22:30:07,767 INFO L280 TraceCheckUtils]: 32: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:30:07,767 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {39#true} {40#false} #69#return; {40#false} is VALID [2020-07-17 22:30:07,768 INFO L280 TraceCheckUtils]: 34: Hoare triple {40#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {40#false} is VALID [2020-07-17 22:30:07,768 INFO L280 TraceCheckUtils]: 35: Hoare triple {40#false} assume 0 == #t~ret16;havoc #t~ret16; {40#false} is VALID [2020-07-17 22:30:07,768 INFO L280 TraceCheckUtils]: 36: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-17 22:30:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:30:07,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356372014] [2020-07-17 22:30:07,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:30:07,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:30:07,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819782573] [2020-07-17 22:30:07,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-17 22:30:07,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:07,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:30:07,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:07,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:30:07,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:30:07,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:30:07,880 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2020-07-17 22:30:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:08,336 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-17 22:30:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:30:08,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-17 22:30:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:30:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2020-07-17 22:30:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:30:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2020-07-17 22:30:08,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2020-07-17 22:30:08,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:08,518 INFO L225 Difference]: With dead ends: 49 [2020-07-17 22:30:08,518 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:30:08,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:30:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:30:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-17 22:30:08,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:08,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-17 22:30:08,619 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:30:08,619 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:30:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:08,626 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:30:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:30:08,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:08,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:08,627 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:30:08,628 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:30:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:08,633 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:30:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:30:08,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:08,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:08,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:08,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:30:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-17 22:30:08,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2020-07-17 22:30:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:08,641 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-17 22:30:08,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:30:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:30:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:30:08,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:08,643 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:08,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:30:08,644 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -213153012, now seen corresponding path program 1 times [2020-07-17 22:30:08,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:08,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132288638] [2020-07-17 22:30:08,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:08,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {269#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {240#true} is VALID [2020-07-17 22:30:08,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:08,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #71#return; {240#true} is VALID [2020-07-17 22:30:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:08,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {270#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {240#true} is VALID [2020-07-17 22:30:08,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:08,932 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #61#return; {240#true} is VALID [2020-07-17 22:30:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:08,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-17 22:30:08,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:08,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,001 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {240#true} #63#return; {252#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2020-07-17 22:30:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:09,010 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {240#true} is VALID [2020-07-17 22:30:09,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {240#true} is VALID [2020-07-17 22:30:09,011 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:09,012 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {240#true} {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #65#return; {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-17 22:30:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:09,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-17 22:30:09,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,031 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #67#return; {262#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-17 22:30:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:09,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {240#true} is VALID [2020-07-17 22:30:09,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:09,038 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {240#true} {241#false} #69#return; {241#false} is VALID [2020-07-17 22:30:09,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {269#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:30:09,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {269#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {240#true} is VALID [2020-07-17 22:30:09,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:09,041 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #71#return; {240#true} is VALID [2020-07-17 22:30:09,041 INFO L263 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret17 := main(); {240#true} is VALID [2020-07-17 22:30:09,042 INFO L263 TraceCheckUtils]: 5: Hoare triple {240#true} call init(); {270#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-17 22:30:09,043 INFO L280 TraceCheckUtils]: 6: Hoare triple {270#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {240#true} is VALID [2020-07-17 22:30:09,043 INFO L280 TraceCheckUtils]: 7: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:09,044 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {240#true} {240#true} #61#return; {240#true} is VALID [2020-07-17 22:30:09,044 INFO L263 TraceCheckUtils]: 9: Hoare triple {240#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {240#true} is VALID [2020-07-17 22:30:09,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {240#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-17 22:30:09,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,049 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {240#true} #63#return; {252#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2020-07-17 22:30:09,049 INFO L280 TraceCheckUtils]: 14: Hoare triple {252#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-17 22:30:09,050 INFO L263 TraceCheckUtils]: 15: Hoare triple {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {240#true} is VALID [2020-07-17 22:30:09,050 INFO L280 TraceCheckUtils]: 16: Hoare triple {240#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {240#true} is VALID [2020-07-17 22:30:09,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {240#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {240#true} is VALID [2020-07-17 22:30:09,051 INFO L280 TraceCheckUtils]: 18: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:09,073 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {240#true} {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #65#return; {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-17 22:30:09,076 INFO L280 TraceCheckUtils]: 20: Hoare triple {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-17 22:30:09,076 INFO L263 TraceCheckUtils]: 21: Hoare triple {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {240#true} is VALID [2020-07-17 22:30:09,077 INFO L280 TraceCheckUtils]: 22: Hoare triple {240#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-17 22:30:09,078 INFO L280 TraceCheckUtils]: 23: Hoare triple {271#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,079 INFO L280 TraceCheckUtils]: 24: Hoare triple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,080 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {272#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {253#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #67#return; {262#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-17 22:30:09,082 INFO L280 TraceCheckUtils]: 26: Hoare triple {262#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {263#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-17 22:30:09,083 INFO L280 TraceCheckUtils]: 27: Hoare triple {263#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; {263#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-17 22:30:09,084 INFO L280 TraceCheckUtils]: 28: Hoare triple {263#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {264#(= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (+ main_~i~0 10))} is VALID [2020-07-17 22:30:09,085 INFO L280 TraceCheckUtils]: 29: Hoare triple {264#(= (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (+ main_~i~0 10))} call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); {265#(= |main_#t~mem14| (+ main_~i~0 10))} is VALID [2020-07-17 22:30:09,085 INFO L280 TraceCheckUtils]: 30: Hoare triple {265#(= |main_#t~mem14| (+ main_~i~0 10))} assume !(~i~0 < #t~mem14);havoc #t~mem14; {241#false} is VALID [2020-07-17 22:30:09,086 INFO L263 TraceCheckUtils]: 31: Hoare triple {241#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {240#true} is VALID [2020-07-17 22:30:09,086 INFO L280 TraceCheckUtils]: 32: Hoare triple {240#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {240#true} is VALID [2020-07-17 22:30:09,086 INFO L280 TraceCheckUtils]: 33: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-17 22:30:09,087 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {240#true} {241#false} #69#return; {241#false} is VALID [2020-07-17 22:30:09,087 INFO L280 TraceCheckUtils]: 35: Hoare triple {241#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {241#false} is VALID [2020-07-17 22:30:09,087 INFO L280 TraceCheckUtils]: 36: Hoare triple {241#false} assume 0 == #t~ret16;havoc #t~ret16; {241#false} is VALID [2020-07-17 22:30:09,088 INFO L280 TraceCheckUtils]: 37: Hoare triple {241#false} assume !false; {241#false} is VALID [2020-07-17 22:30:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 22:30:09,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132288638] [2020-07-17 22:30:09,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883868843] [2020-07-17 22:30:09,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:09,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 57 conjunts are in the unsatisfiable core [2020-07-17 22:30:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:09,203 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:09,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:30:09,862 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-17 22:30:09,869 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:30:09,876 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:30:09,876 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:30:09,877 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2020-07-17 22:30:09,880 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:30:09,880 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|]. (let ((.cse0 (select (select |#memory_int| main_~pd2~0.base) 0))) (and (not (= 0 main_~pd2~0.base)) (<= .cse0 |main_#t~mem14|) (<= (+ main_~i~0 10) .cse0))) [2020-07-17 22:30:09,881 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= 0 main_~pd2~0.base)) (<= (+ main_~i~0 10) |main_#t~mem14|)) [2020-07-17 22:30:09,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {240#true} is VALID [2020-07-17 22:30:09,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(= 0 |~#d1~0.offset|)} assume true; {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,949 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {279#(= 0 |~#d1~0.offset|)} {240#true} #71#return; {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,950 INFO L263 TraceCheckUtils]: 4: Hoare triple {279#(= 0 |~#d1~0.offset|)} call #t~ret17 := main(); {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,951 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#(= 0 |~#d1~0.offset|)} call init(); {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#(= 0 |~#d1~0.offset|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#(= 0 |~#d1~0.offset|)} assume true; {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,953 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {279#(= 0 |~#d1~0.offset|)} {279#(= 0 |~#d1~0.offset|)} #61#return; {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,953 INFO L263 TraceCheckUtils]: 9: Hoare triple {279#(= 0 |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,954 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#(= 0 |~#d1~0.offset|)} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {307#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-17 22:30:09,955 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,956 INFO L280 TraceCheckUtils]: 12: Hoare triple {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,957 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {279#(= 0 |~#d1~0.offset|)} #63#return; {318#(and (= 0 |~#d1~0.offset|) (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2020-07-17 22:30:09,958 INFO L280 TraceCheckUtils]: 14: Hoare triple {318#(and (= 0 |~#d1~0.offset|) (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {322#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-17 22:30:09,959 INFO L263 TraceCheckUtils]: 15: Hoare triple {322#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,960 INFO L280 TraceCheckUtils]: 16: Hoare triple {279#(= 0 |~#d1~0.offset|)} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {329#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-17 22:30:09,961 INFO L280 TraceCheckUtils]: 17: Hoare triple {329#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {333#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,962 INFO L280 TraceCheckUtils]: 18: Hoare triple {333#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {333#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,963 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {333#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {322#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #65#return; {340#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret8.base|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-17 22:30:09,964 INFO L280 TraceCheckUtils]: 20: Hoare triple {340#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret8.base|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {344#(and (= 0 |~#d1~0.offset|) (= main_~pd2~0.base |~#d1~0.base|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-17 22:30:09,965 INFO L263 TraceCheckUtils]: 21: Hoare triple {344#(and (= 0 |~#d1~0.offset|) (= main_~pd2~0.base |~#d1~0.base|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {279#(= 0 |~#d1~0.offset|)} is VALID [2020-07-17 22:30:09,967 INFO L280 TraceCheckUtils]: 22: Hoare triple {279#(= 0 |~#d1~0.offset|)} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {307#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-17 22:30:09,968 INFO L280 TraceCheckUtils]: 23: Hoare triple {307#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,968 INFO L280 TraceCheckUtils]: 24: Hoare triple {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-17 22:30:09,970 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {311#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {344#(and (= 0 |~#d1~0.offset|) (= main_~pd2~0.base |~#d1~0.base|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #67#return; {360#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd2~0.base |main_#t~ret9.base|) (= 0 |main_#t~ret9.offset|) (= main_~pd1~0.offset 0))} is VALID [2020-07-17 22:30:09,971 INFO L280 TraceCheckUtils]: 26: Hoare triple {360#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd2~0.base |main_#t~ret9.base|) (= 0 |main_#t~ret9.offset|) (= main_~pd1~0.offset 0))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {364#(and (= main_~pd3~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not |main_#t~short12|)) (= main_~pd1~0.offset 0) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd3~0.offset 0))} is VALID [2020-07-17 22:30:09,972 INFO L280 TraceCheckUtils]: 27: Hoare triple {364#(and (= main_~pd3~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not |main_#t~short12|)) (= main_~pd1~0.offset 0) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd3~0.offset 0))} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; {368#(and (= main_~pd3~0.base main_~pd1~0.base) (not (= 0 main_~pd1~0.base)) (= main_~pd1~0.offset 0) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd3~0.offset 0))} is VALID [2020-07-17 22:30:09,974 INFO L280 TraceCheckUtils]: 28: Hoare triple {368#(and (= main_~pd3~0.base main_~pd1~0.base) (not (= 0 main_~pd1~0.base)) (= main_~pd1~0.offset 0) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd3~0.offset 0))} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {372#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (= main_~pd2~0.base main_~pa~0.base) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} is VALID [2020-07-17 22:30:09,974 INFO L280 TraceCheckUtils]: 29: Hoare triple {372#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (= main_~pd2~0.base main_~pa~0.base) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); {376#(and (not (= 0 main_~pd2~0.base)) (<= (+ main_~i~0 10) |main_#t~mem14|))} is VALID [2020-07-17 22:30:09,975 INFO L280 TraceCheckUtils]: 30: Hoare triple {376#(and (not (= 0 main_~pd2~0.base)) (<= (+ main_~i~0 10) |main_#t~mem14|))} assume !(~i~0 < #t~mem14);havoc #t~mem14; {241#false} is VALID [2020-07-17 22:30:09,976 INFO L263 TraceCheckUtils]: 31: Hoare triple {241#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {241#false} is VALID [2020-07-17 22:30:09,976 INFO L280 TraceCheckUtils]: 32: Hoare triple {241#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {241#false} is VALID [2020-07-17 22:30:09,976 INFO L280 TraceCheckUtils]: 33: Hoare triple {241#false} assume true; {241#false} is VALID [2020-07-17 22:30:09,976 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {241#false} {241#false} #69#return; {241#false} is VALID [2020-07-17 22:30:09,977 INFO L280 TraceCheckUtils]: 35: Hoare triple {241#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {241#false} is VALID [2020-07-17 22:30:09,977 INFO L280 TraceCheckUtils]: 36: Hoare triple {241#false} assume 0 == #t~ret16;havoc #t~ret16; {241#false} is VALID [2020-07-17 22:30:09,977 INFO L280 TraceCheckUtils]: 37: Hoare triple {241#false} assume !false; {241#false} is VALID [2020-07-17 22:30:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 22:30:09,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:09,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2020-07-17 22:30:09,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112090605] [2020-07-17 22:30:09,985 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2020-07-17 22:30:09,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:09,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2020-07-17 22:30:10,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:10,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-17 22:30:10,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-17 22:30:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2020-07-17 22:30:10,072 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 26 states. [2020-07-17 22:30:13,395 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-07-17 22:30:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:15,065 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2020-07-17 22:30:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 22:30:15,066 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2020-07-17 22:30:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-17 22:30:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2020-07-17 22:30:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-17 22:30:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2020-07-17 22:30:15,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 114 transitions. [2020-07-17 22:30:15,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:15,348 INFO L225 Difference]: With dead ends: 93 [2020-07-17 22:30:15,348 INFO L226 Difference]: Without dead ends: 85 [2020-07-17 22:30:15,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2020-07-17 22:30:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-17 22:30:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 43. [2020-07-17 22:30:15,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:15,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 43 states. [2020-07-17 22:30:15,466 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 43 states. [2020-07-17 22:30:15,466 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 43 states. [2020-07-17 22:30:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:15,475 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2020-07-17 22:30:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2020-07-17 22:30:15,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:15,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:15,478 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 85 states. [2020-07-17 22:30:15,478 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 85 states. [2020-07-17 22:30:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:15,491 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2020-07-17 22:30:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2020-07-17 22:30:15,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:15,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:15,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:15,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:30:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2020-07-17 22:30:15,505 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 38 [2020-07-17 22:30:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:15,506 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2020-07-17 22:30:15,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-17 22:30:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2020-07-17 22:30:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:30:15,512 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:15,512 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:15,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:30:15,727 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1234221366, now seen corresponding path program 1 times [2020-07-17 22:30:15,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:15,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356687909] [2020-07-17 22:30:15,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:30:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:30:15,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:30:15,830 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:30:15,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:30:15,882 WARN L170 areAnnotationChecker]: initENTRY has no Hoare annotation [2020-07-17 22:30:15,882 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:30:15,882 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:30:15,882 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:30:15,882 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2020-07-17 22:30:15,882 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:30:15,883 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2020-07-17 22:30:15,884 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:30:15,885 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:30:15,886 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:30:15,887 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-17 22:30:15,888 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-17 22:30:15,888 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-17 22:30:15,888 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-17 22:30:15,888 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. [2020-07-17 22:30:15,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:30:15 BoogieIcfgContainer [2020-07-17 22:30:15,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:30:15,894 INFO L168 Benchmark]: Toolchain (without parser) took 9762.03 ms. Allocated memory was 145.2 MB in the beginning and 334.5 MB in the end (delta: 189.3 MB). Free memory was 102.9 MB in the beginning and 198.2 MB in the end (delta: -95.3 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:15,895 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:30:15,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.59 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 181.3 MB in the end (delta: -78.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:15,896 INFO L168 Benchmark]: Boogie Preprocessor took 80.06 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 178.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:15,897 INFO L168 Benchmark]: RCFGBuilder took 507.93 ms. Allocated memory is still 202.4 MB. Free memory was 178.9 MB in the beginning and 150.8 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:15,898 INFO L168 Benchmark]: TraceAbstraction took 8709.65 ms. Allocated memory was 202.4 MB in the beginning and 334.5 MB in the end (delta: 132.1 MB). Free memory was 150.8 MB in the beginning and 198.2 MB in the end (delta: -47.4 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:15,902 INFO L336 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 457.59 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 181.3 MB in the end (delta: -78.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.06 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 178.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 507.93 ms. Allocated memory is still 202.4 MB. Free memory was 178.9 MB in the beginning and 150.8 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8709.65 ms. Allocated memory was 202.4 MB in the beginning and 334.5 MB in the end (delta: 132.1 MB). Free memory was 150.8 MB in the beginning and 198.2 MB in the end (delta: -47.4 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 48]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] struct dummy d1, d2; VAL [\old(d1)=18, \old(d1)=22, \old(d2)=19, \old(d2)=21, d1={3:0}, d2={2:0}] [L32] CALL init() VAL [d1={3:0}, d2={2:0}] [L13] d1.a = __VERIFIER_nondet_int() [L14] d1.b = __VERIFIER_nondet_int() [L16] d2.a = __VERIFIER_nondet_int() [L17] d2.b = __VERIFIER_nondet_int() [L32] RET init() VAL [d1={3:0}, d2={2:0}] [L33] CALL, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={3:0}, d1={3:0}, d2={2:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}, get_dummy()={3:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={3:0}, d1={3:0}, d2={2:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}, get_dummy()={3:0}, pd1={3:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={2:0}, d1={3:0}, d2={2:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}, get_dummy()={2:0}, pd1={3:0}, pd2={3:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L34] int i = __VERIFIER_nondet_int(); [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] EXPR (*pd2).a [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=5, d1={3:0}, d2={2:0}, i=0, pd1={3:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={3:0}, pd3={2:0}] [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L36] int *pa = &pd1->a; [L37] EXPR pd3->a [L37] i = pd3->a - 10 [L38] EXPR \read(*pa) VAL [\read(*pa)=5, d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L38] COND FALSE !(i < *pa) [L41] CALL, EXPR check(pd2, i) VAL [\old(i)=6, d1={3:0}, d2={2:0}, s1={3:0}] [L27] EXPR s1->a [L27] return s1->a == i; [L41] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L41] COND TRUE !check(pd2, i) [L48] __VERIFIER_error() VAL [d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.5s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 52 SDtfs, 177 SDslu, 62 SDs, 0 SdLazy, 689 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 17069 SizeOfPredicates, 13 NumberOfNonLiveVariables, 183 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 30/36 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! Received shutdown request...