/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test29-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:22:22,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:22:22,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:22:22,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:22:22,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:22:22,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:22:22,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:22:22,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:22:22,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:22:22,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:22:22,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:22:22,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:22:22,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:22:22,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:22:22,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:22:22,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:22:22,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:22:22,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:22:22,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:22:22,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:22:22,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:22:22,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:22:22,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:22:22,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:22:22,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:22:22,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:22:22,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:22:22,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:22:22,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:22:22,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:22:22,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:22:22,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:22:22,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:22:22,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:22:22,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:22:22,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:22:22,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:22:22,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:22:22,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:22:22,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:22:22,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:22:22,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:22:22,963 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:22:22,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:22:22,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:22:22,966 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:22:22,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:22:22,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:22:22,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:22:22,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:22:22,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:22:22,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:22:22,968 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:22:22,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:22:22,968 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:22:22,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:22:22,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:22:22,969 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:22:22,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:22:22,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:22:22,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:22:22,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:22:22,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:22:22,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:22:22,970 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:22:23,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:22:23,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:22:23,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:22:23,289 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:22:23,289 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:22:23,290 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29-2.c [2020-07-18 00:22:23,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0562f53d/2e9748804f554cee9671617bc1865a47/FLAG4d88ab92e [2020-07-18 00:22:23,840 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:22:23,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-2.c [2020-07-18 00:22:23,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0562f53d/2e9748804f554cee9671617bc1865a47/FLAG4d88ab92e [2020-07-18 00:22:24,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0562f53d/2e9748804f554cee9671617bc1865a47 [2020-07-18 00:22:24,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:22:24,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:22:24,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:22:24,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:22:24,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:22:24,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6ef254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24, skipping insertion in model container [2020-07-18 00:22:24,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:22:24,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:22:24,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:22:24,412 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:22:24,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:22:24,451 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:22:24,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24 WrapperNode [2020-07-18 00:22:24,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:22:24,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:22:24,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:22:24,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:22:24,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (1/1) ... [2020-07-18 00:22:24,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:22:24,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:22:24,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:22:24,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:22:24,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (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-18 00:22:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:22:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:22:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:22:25,046 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:22:25,047 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:22:25,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:22:25 BoogieIcfgContainer [2020-07-18 00:22:25,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:22:25,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:22:25,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:22:25,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:22:25,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:22:24" (1/3) ... [2020-07-18 00:22:25,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7342c43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:22:25, skipping insertion in model container [2020-07-18 00:22:25,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:22:24" (2/3) ... [2020-07-18 00:22:25,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7342c43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:22:25, skipping insertion in model container [2020-07-18 00:22:25,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:22:25" (3/3) ... [2020-07-18 00:22:25,059 INFO L109 eAbstractionObserver]: Analyzing ICFG test29-2.c [2020-07-18 00:22:25,070 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:22:25,076 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:22:25,088 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:22:25,108 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:22:25,108 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:22:25,108 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:22:25,109 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:22:25,109 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:22:25,109 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:22:25,109 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:22:25,109 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:22:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-18 00:22:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 00:22:25,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:22:25,138 INFO L422 BasicCegarLoop]: trace histogram [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-18 00:22:25,138 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:22:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:22:25,145 INFO L82 PathProgramCache]: Analyzing trace with hash -374520961, now seen corresponding path program 1 times [2020-07-18 00:22:25,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:22:25,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908952376] [2020-07-18 00:22:25,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:22:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:25,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-18 00:22:25,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-18 00:22:25,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-18 00:22:25,395 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 00:22:25,395 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-18 00:22:25,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:22:25,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-18 00:22:25,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-18 00:22:25,401 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-18 00:22:25,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 00:22:25,402 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-18 00:22:25,402 INFO L263 TraceCheckUtils]: 6: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID [2020-07-18 00:22:25,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {48#true} is VALID [2020-07-18 00:22:25,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {48#true} is VALID [2020-07-18 00:22:25,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {48#true} is VALID [2020-07-18 00:22:25,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#true} ~n~0 := #t~nondet0; {48#true} is VALID [2020-07-18 00:22:25,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#true} havoc #t~nondet0; {48#true} is VALID [2020-07-18 00:22:25,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#true} assume !(0 != ~n~0); {48#true} is VALID [2020-07-18 00:22:25,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#true} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {48#true} is VALID [2020-07-18 00:22:25,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#true} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-18 00:22:25,407 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#true} havoc #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-18 00:22:25,407 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#true} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {48#true} is VALID [2020-07-18 00:22:25,408 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#true} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L17 {48#true} is VALID [2020-07-18 00:22:25,408 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#true} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {48#true} is VALID [2020-07-18 00:22:25,409 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#true} assume !#t~short3; {55#(not |main_#t~short3|)} is VALID [2020-07-18 00:22:25,411 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#(not |main_#t~short3|)} assume #t~short3; {49#false} is VALID [2020-07-18 00:22:25,411 INFO L280 TraceCheckUtils]: 21: Hoare triple {49#false} havoc #t~mem2; {49#false} is VALID [2020-07-18 00:22:25,412 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} havoc #t~short3; {49#false} is VALID [2020-07-18 00:22:25,412 INFO L280 TraceCheckUtils]: 23: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-18 00:22:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:22:25,418 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:22:25,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908952376] [2020-07-18 00:22:25,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:22:25,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:22:25,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255354335] [2020-07-18 00:22:25,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-18 00:22:25,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:22:25,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:22:25,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:25,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:22:25,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:22:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:22:25,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:22:25,501 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-07-18 00:22:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:25,762 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-18 00:22:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:22:25,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-18 00:22:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:22:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:22:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-18 00:22:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:22:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-18 00:22:25,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2020-07-18 00:22:25,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:25,893 INFO L225 Difference]: With dead ends: 54 [2020-07-18 00:22:25,893 INFO L226 Difference]: Without dead ends: 29 [2020-07-18 00:22:25,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:22:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-18 00:22:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-18 00:22:25,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:22:25,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-18 00:22:25,959 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-18 00:22:25,959 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-18 00:22:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:25,963 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-18 00:22:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-18 00:22:25,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:25,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:25,965 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-18 00:22:25,965 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-18 00:22:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:25,968 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-18 00:22:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-18 00:22:25,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:25,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:25,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:22:25,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:22:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-18 00:22:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-18 00:22:25,974 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2020-07-18 00:22:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:22:25,975 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-18 00:22:25,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:22:25,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2020-07-18 00:22:26,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-18 00:22:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 00:22:26,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:22:26,018 INFO L422 BasicCegarLoop]: trace histogram [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-18 00:22:26,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:22:26,019 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:22:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:22:26,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1400624444, now seen corresponding path program 1 times [2020-07-18 00:22:26,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:22:26,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1189318967] [2020-07-18 00:22:26,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:22:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:26,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-18 00:22:26,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-18 00:22:26,180 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-18 00:22:26,180 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-18 00:22:26,180 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-18 00:22:26,183 INFO L263 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:22:26,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-18 00:22:26,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-18 00:22:26,185 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-18 00:22:26,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-18 00:22:26,185 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-18 00:22:26,186 INFO L263 TraceCheckUtils]: 6: Hoare triple {283#true} call #t~ret4 := main(); {283#true} is VALID [2020-07-18 00:22:26,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {283#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {290#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-18 00:22:26,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {290#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:26,190 INFO L280 TraceCheckUtils]: 9: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:26,191 INFO L280 TraceCheckUtils]: 10: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:26,192 INFO L280 TraceCheckUtils]: 11: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:26,194 INFO L280 TraceCheckUtils]: 12: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume !(0 != ~n~0); {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:26,194 INFO L280 TraceCheckUtils]: 13: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {292#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} is VALID [2020-07-18 00:22:26,195 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-18 00:22:26,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} havoc #t~ite1.base, #t~ite1.offset; {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-18 00:22:26,198 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#(not (= |main_~#d1~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {284#false} is VALID [2020-07-18 00:22:26,199 INFO L280 TraceCheckUtils]: 17: Hoare triple {284#false} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L17 {284#false} is VALID [2020-07-18 00:22:26,199 INFO L280 TraceCheckUtils]: 18: Hoare triple {284#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {284#false} is VALID [2020-07-18 00:22:26,203 INFO L280 TraceCheckUtils]: 19: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-18 00:22:26,203 INFO L280 TraceCheckUtils]: 20: Hoare triple {284#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1); srcloc: L21-1 {284#false} is VALID [2020-07-18 00:22:26,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {284#false} #t~short3 := 0 != #t~mem2; {284#false} is VALID [2020-07-18 00:22:26,204 INFO L280 TraceCheckUtils]: 22: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-18 00:22:26,204 INFO L280 TraceCheckUtils]: 23: Hoare triple {284#false} havoc #t~mem2; {284#false} is VALID [2020-07-18 00:22:26,204 INFO L280 TraceCheckUtils]: 24: Hoare triple {284#false} havoc #t~short3; {284#false} is VALID [2020-07-18 00:22:26,205 INFO L280 TraceCheckUtils]: 25: Hoare triple {284#false} assume !false; {284#false} is VALID [2020-07-18 00:22:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:22:26,209 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:22:26,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1189318967] [2020-07-18 00:22:26,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:22:26,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:22:26,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232755379] [2020-07-18 00:22:26,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-18 00:22:26,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:22:26,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:22:26,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:26,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:22:26,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:22:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:22:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:22:26,250 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2020-07-18 00:22:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:26,648 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2020-07-18 00:22:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:22:26,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-18 00:22:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:22:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:22:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-18 00:22:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:22:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-18 00:22:26,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-18 00:22:26,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:26,735 INFO L225 Difference]: With dead ends: 52 [2020-07-18 00:22:26,735 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 00:22:26,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:22:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 00:22:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-07-18 00:22:26,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:22:26,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 32 states. [2020-07-18 00:22:26,804 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 32 states. [2020-07-18 00:22:26,804 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 32 states. [2020-07-18 00:22:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:26,808 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-18 00:22:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-18 00:22:26,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:26,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:26,809 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 42 states. [2020-07-18 00:22:26,810 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 42 states. [2020-07-18 00:22:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:26,813 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-18 00:22:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-18 00:22:26,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:26,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:26,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:22:26,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:22:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 00:22:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-18 00:22:26,818 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2020-07-18 00:22:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:22:26,818 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-18 00:22:26,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:22:26,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-18 00:22:26,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-18 00:22:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 00:22:26,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:22:26,871 INFO L422 BasicCegarLoop]: trace histogram [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-18 00:22:26,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:22:26,883 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:22:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:22:26,885 INFO L82 PathProgramCache]: Analyzing trace with hash -316312164, now seen corresponding path program 1 times [2020-07-18 00:22:26,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:22:26,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006504921] [2020-07-18 00:22:26,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:22:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:27,009 INFO L280 TraceCheckUtils]: 0: Hoare triple {569#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-18 00:22:27,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-18 00:22:27,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-18 00:22:27,010 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-18 00:22:27,010 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-18 00:22:27,012 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {569#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:22:27,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {569#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-18 00:22:27,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-18 00:22:27,013 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-18 00:22:27,013 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-18 00:22:27,013 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-18 00:22:27,013 INFO L263 TraceCheckUtils]: 6: Hoare triple {557#true} call #t~ret4 := main(); {557#true} is VALID [2020-07-18 00:22:27,014 INFO L280 TraceCheckUtils]: 7: Hoare triple {557#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {557#true} is VALID [2020-07-18 00:22:27,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {557#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {557#true} is VALID [2020-07-18 00:22:27,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {557#true} is VALID [2020-07-18 00:22:27,015 INFO L280 TraceCheckUtils]: 10: Hoare triple {557#true} ~n~0 := #t~nondet0; {557#true} is VALID [2020-07-18 00:22:27,015 INFO L280 TraceCheckUtils]: 11: Hoare triple {557#true} havoc #t~nondet0; {557#true} is VALID [2020-07-18 00:22:27,015 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} assume !(0 != ~n~0); {557#true} is VALID [2020-07-18 00:22:27,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {557#true} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {564#(and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,017 INFO L280 TraceCheckUtils]: 14: Hoare triple {564#(and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,018 INFO L280 TraceCheckUtils]: 15: Hoare triple {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} havoc #t~ite1.base, #t~ite1.offset; {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,019 INFO L280 TraceCheckUtils]: 16: Hoare triple {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,020 INFO L280 TraceCheckUtils]: 17: Hoare triple {565#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 1); srcloc: L19 {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-18 00:22:27,021 INFO L280 TraceCheckUtils]: 18: Hoare triple {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-18 00:22:27,022 INFO L280 TraceCheckUtils]: 19: Hoare triple {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} assume #t~short3; {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-18 00:22:27,023 INFO L280 TraceCheckUtils]: 20: Hoare triple {566#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1); srcloc: L21-1 {567#(= 0 |main_#t~mem2|)} is VALID [2020-07-18 00:22:27,026 INFO L280 TraceCheckUtils]: 21: Hoare triple {567#(= 0 |main_#t~mem2|)} #t~short3 := 0 != #t~mem2; {568#(not |main_#t~short3|)} is VALID [2020-07-18 00:22:27,027 INFO L280 TraceCheckUtils]: 22: Hoare triple {568#(not |main_#t~short3|)} assume #t~short3; {558#false} is VALID [2020-07-18 00:22:27,027 INFO L280 TraceCheckUtils]: 23: Hoare triple {558#false} havoc #t~mem2; {558#false} is VALID [2020-07-18 00:22:27,027 INFO L280 TraceCheckUtils]: 24: Hoare triple {558#false} havoc #t~short3; {558#false} is VALID [2020-07-18 00:22:27,028 INFO L280 TraceCheckUtils]: 25: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-18 00:22:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:22:27,030 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:22:27,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006504921] [2020-07-18 00:22:27,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:22:27,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:22:27,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350618766] [2020-07-18 00:22:27,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-18 00:22:27,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:22:27,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:22:27,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:27,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:22:27,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:22:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:22:27,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:22:27,068 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 8 states. [2020-07-18 00:22:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:27,488 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-18 00:22:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:22:27,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-18 00:22:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:22:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:22:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-18 00:22:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:22:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2020-07-18 00:22:27,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2020-07-18 00:22:27,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:27,545 INFO L225 Difference]: With dead ends: 42 [2020-07-18 00:22:27,545 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 00:22:27,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:22:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 00:22:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 00:22:27,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:22:27,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 00:22:27,594 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:22:27,595 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:22:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:27,596 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-18 00:22:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 00:22:27,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:27,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:27,598 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:22:27,598 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:22:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:27,600 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-18 00:22:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 00:22:27,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:27,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:27,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:22:27,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:22:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:22:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-18 00:22:27,606 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2020-07-18 00:22:27,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:22:27,606 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-18 00:22:27,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:22:27,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-18 00:22:27,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 00:22:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 00:22:27,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:22:27,645 INFO L422 BasicCegarLoop]: trace histogram [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-18 00:22:27,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:22:27,646 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:22:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:22:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash -497457956, now seen corresponding path program 1 times [2020-07-18 00:22:27,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:22:27,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [893136541] [2020-07-18 00:22:27,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:22:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:22:27,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {788#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {776#true} is VALID [2020-07-18 00:22:27,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} #valid := #valid[0 := 0]; {776#true} is VALID [2020-07-18 00:22:27,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-18 00:22:27,823 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-18 00:22:27,824 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {776#true} {776#true} #62#return; {776#true} is VALID [2020-07-18 00:22:27,825 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {788#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:22:27,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {788#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {776#true} is VALID [2020-07-18 00:22:27,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} #valid := #valid[0 := 0]; {776#true} is VALID [2020-07-18 00:22:27,826 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#true} assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-18 00:22:27,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-18 00:22:27,826 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {776#true} {776#true} #62#return; {776#true} is VALID [2020-07-18 00:22:27,827 INFO L263 TraceCheckUtils]: 6: Hoare triple {776#true} call #t~ret4 := main(); {776#true} is VALID [2020-07-18 00:22:27,828 INFO L280 TraceCheckUtils]: 7: Hoare triple {776#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {783#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-18 00:22:27,829 INFO L280 TraceCheckUtils]: 8: Hoare triple {783#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,831 INFO L280 TraceCheckUtils]: 9: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,834 INFO L280 TraceCheckUtils]: 12: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0; {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {784#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {785#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {785#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,838 INFO L280 TraceCheckUtils]: 15: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} havoc #t~ite1.base, #t~ite1.offset; {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,839 INFO L280 TraceCheckUtils]: 16: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,840 INFO L280 TraceCheckUtils]: 17: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L17 {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-18 00:22:27,841 INFO L280 TraceCheckUtils]: 18: Hoare triple {786#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {787#(not |main_#t~short3|)} is VALID [2020-07-18 00:22:27,843 INFO L280 TraceCheckUtils]: 19: Hoare triple {787#(not |main_#t~short3|)} assume #t~short3; {777#false} is VALID [2020-07-18 00:22:27,843 INFO L280 TraceCheckUtils]: 20: Hoare triple {777#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1); srcloc: L21-1 {777#false} is VALID [2020-07-18 00:22:27,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {777#false} #t~short3 := 0 != #t~mem2; {777#false} is VALID [2020-07-18 00:22:27,843 INFO L280 TraceCheckUtils]: 22: Hoare triple {777#false} assume #t~short3; {777#false} is VALID [2020-07-18 00:22:27,844 INFO L280 TraceCheckUtils]: 23: Hoare triple {777#false} havoc #t~mem2; {777#false} is VALID [2020-07-18 00:22:27,844 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#false} havoc #t~short3; {777#false} is VALID [2020-07-18 00:22:27,844 INFO L280 TraceCheckUtils]: 25: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-18 00:22:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:22:27,846 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:22:27,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [893136541] [2020-07-18 00:22:27,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:22:27,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:22:27,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459408894] [2020-07-18 00:22:27,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-18 00:22:27,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:22:27,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:22:27,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:27,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:22:27,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:22:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:22:27,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:22:27,877 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2020-07-18 00:22:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:28,195 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-18 00:22:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:22:28,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-18 00:22:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:22:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:22:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-18 00:22:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:22:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-18 00:22:28,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2020-07-18 00:22:28,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:28,241 INFO L225 Difference]: With dead ends: 28 [2020-07-18 00:22:28,241 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:22:28,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:22:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:22:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:22:28,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:22:28,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:22:28,246 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:22:28,246 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:22:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:28,246 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:22:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:22:28,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:28,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:28,247 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:22:28,247 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:22:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:22:28,248 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:22:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:22:28,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:28,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:22:28,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:22:28,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:22:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:22:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:22:28,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-18 00:22:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:22:28,249 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:22:28,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:22:28,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:22:28,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:22:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:22:28,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:22:28,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:22:28,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:22:28,776 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,776 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,776 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,777 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-18 00:22:28,777 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,777 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,777 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,777 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,777 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:22:28,778 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 29) the Hoare annotation is: true [2020-07-18 00:22:28,778 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 (not (= main_~pd~0.base |main_~#d2~0.base|))) (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse0 .cse1))) [2020-07-18 00:22:28,778 INFO L264 CegarLoopResult]: At program point L19-1(lines 16 20) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 (not (= main_~pd~0.base |main_~#d2~0.base|))) (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) .cse0 .cse1))) [2020-07-18 00:22:28,778 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,779 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,779 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,779 INFO L264 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 (not (= |main_#t~ite1.base| |main_~#d2~0.base|))) (and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) .cse0 .cse1))) [2020-07-18 00:22:28,779 INFO L264 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse2 (= main_~pd~0.base |main_~#d2~0.base|)) (.cse1 (= |main_#t~ite1.base| |main_~#d2~0.base|)) (.cse0 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) .cse0 (not .cse1) (not .cse2)) (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse2 (= |main_#t~ite1.offset| |main_~#d2~0.offset|) .cse1 .cse0 (not (= |main_~#d1~0.base| |main_#t~ite1.base|))))) [2020-07-18 00:22:28,779 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: false [2020-07-18 00:22:28,779 INFO L264 CegarLoopResult]: At program point L16(lines 16 20) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 (not (= main_~pd~0.base |main_~#d2~0.base|))) (and (= |main_~#d2~0.offset| main_~pd~0.offset) .cse0 .cse1))) [2020-07-18 00:22:28,780 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 00:22:28,780 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|))) (.cse0 (= main_~pd~0.base |main_~#d2~0.base|))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) .cse0 .cse1 .cse2) (and .cse1 .cse2 (not |main_#t~short3|) (not .cse0)))) [2020-07-18 00:22:28,780 INFO L264 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,780 INFO L264 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= 0 |main_#t~mem2|) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,780 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|)) (not (= main_~pd~0.base |main_~#d2~0.base|))) [2020-07-18 00:22:28,780 INFO L264 CegarLoopResult]: At program point L21-4(lines 21 23) the Hoare annotation is: (not |main_#t~short3|) [2020-07-18 00:22:28,780 INFO L264 CegarLoopResult]: At program point L21-5(line 21) the Hoare annotation is: false [2020-07-18 00:22:28,780 INFO L264 CegarLoopResult]: At program point L21-6(line 21) the Hoare annotation is: false [2020-07-18 00:22:28,781 INFO L264 CegarLoopResult]: At program point L21-7(line 21) the Hoare annotation is: (not |main_#t~short3|) [2020-07-18 00:22:28,781 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= 1 (select |#valid| |main_~#d1~0.base|)) [2020-07-18 00:22:28,781 INFO L264 CegarLoopResult]: At program point L21-8(line 21) the Hoare annotation is: (not |main_#t~short3|) [2020-07-18 00:22:28,781 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 29) the Hoare annotation is: true [2020-07-18 00:22:28,781 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,781 INFO L271 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: true [2020-07-18 00:22:28,781 INFO L271 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: true [2020-07-18 00:22:28,781 INFO L271 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: true [2020-07-18 00:22:28,781 INFO L271 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: true [2020-07-18 00:22:28,781 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: false [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point L13-7(line 13) the Hoare annotation is: false [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point L13-8(line 13) the Hoare annotation is: false [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point L13-9(line 13) the Hoare annotation is: false [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 29) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point L22(lines 12 29) the Hoare annotation is: false [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,782 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-18 00:22:28,803 INFO L163 areAnnotationChecker]: CFG has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:22:28,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:22:28 BoogieIcfgContainer [2020-07-18 00:22:28,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:22:28,816 INFO L168 Benchmark]: Toolchain (without parser) took 4624.48 ms. Allocated memory was 144.7 MB in the beginning and 281.5 MB in the end (delta: 136.8 MB). Free memory was 103.3 MB in the beginning and 243.0 MB in the end (delta: -139.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:22:28,817 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:22:28,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.66 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 92.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:28,819 INFO L168 Benchmark]: Boogie Preprocessor took 129.37 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 179.8 MB in the end (delta: -87.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:28,820 INFO L168 Benchmark]: RCFGBuilder took 469.15 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 157.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:28,821 INFO L168 Benchmark]: TraceAbstraction took 3760.74 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 157.0 MB in the beginning and 243.0 MB in the end (delta: -85.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:22:28,824 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 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.66 ms. Allocated memory is still 144.7 MB. Free memory was 102.9 MB in the beginning and 92.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.37 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 179.8 MB in the end (delta: -87.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.15 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 157.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3760.74 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 157.0 MB in the beginning and 243.0 MB in the end (delta: -85.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 95 SDtfs, 108 SDslu, 246 SDs, 0 SdLazy, 227 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, 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, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 62 NumberOfFragments, 371 HoareAnnotationTreeSize, 45 FomulaSimplifications, 206 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...