/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/loops/terminator_02-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:10,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:10,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:10,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:10,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:10,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:10,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:10,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:10,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:10,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:10,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:10,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:10,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:10,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:10,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:10,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:10,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:10,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:10,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:10,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:10,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:10,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:10,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:10,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:10,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:10,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:10,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:10,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:10,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:10,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:10,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:10,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:10,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:10,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:10,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:10,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:10,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:10,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:10,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:10,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:10,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:10,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:10,356 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:10,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:10,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:10,363 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:10,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:10,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:10,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:10,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:10,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:10,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:10,364 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:10,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:10,364 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:10,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:10,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:10,365 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:10,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:10,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:10,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:10,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:10,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:10,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:10,368 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:10,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:10,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:10,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:10,682 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:10,682 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:10,683 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/terminator_02-2.c [2020-07-10 20:22:10,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccd6c998/55956e2488134750be1df3195a1f8fb0/FLAG2a13c52bc [2020-07-10 20:22:11,217 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:11,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/terminator_02-2.c [2020-07-10 20:22:11,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccd6c998/55956e2488134750be1df3195a1f8fb0/FLAG2a13c52bc [2020-07-10 20:22:11,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccd6c998/55956e2488134750be1df3195a1f8fb0 [2020-07-10 20:22:11,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:11,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:11,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:11,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:11,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:11,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:11,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525180bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11, skipping insertion in model container [2020-07-10 20:22:11,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:11,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:11,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:11,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:11,928 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:11,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:11,963 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:11,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11 WrapperNode [2020-07-10 20:22:11,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:11,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:11,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:11,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:11,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:11,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:11,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:11,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:11,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:12,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:12,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (1/1) ... [2020-07-10 20:22:12,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:12,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:12,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:12,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:12,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (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-10 20:22:12,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:22:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:22:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:22:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:22:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 20:22:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:12,516 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:12,516 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:12,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:12 BoogieIcfgContainer [2020-07-10 20:22:12,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:12,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:12,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:12,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:12,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:11" (1/3) ... [2020-07-10 20:22:12,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68194e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:12, skipping insertion in model container [2020-07-10 20:22:12,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:11" (2/3) ... [2020-07-10 20:22:12,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68194e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:12, skipping insertion in model container [2020-07-10 20:22:12,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:12" (3/3) ... [2020-07-10 20:22:12,530 INFO L109 eAbstractionObserver]: Analyzing ICFG terminator_02-2.c [2020-07-10 20:22:12,541 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:12,553 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:12,567 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:12,585 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:12,585 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:12,585 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:12,585 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:12,585 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:12,586 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:12,586 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:12,586 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-10 20:22:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 20:22:12,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:12,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:12,617 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash 664980376, now seen corresponding path program 1 times [2020-07-10 20:22:12,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:12,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1206899759] [2020-07-10 20:22:12,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:12,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-10 20:22:12,781 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {46#true} {46#true} #83#return; {46#true} is VALID [2020-07-10 20:22:12,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2020-07-10 20:22:12,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-10 20:22:12,783 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #83#return; {46#true} is VALID [2020-07-10 20:22:12,784 INFO L263 TraceCheckUtils]: 3: Hoare triple {46#true} call #t~ret6 := main(); {46#true} is VALID [2020-07-10 20:22:12,784 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {46#true} is VALID [2020-07-10 20:22:12,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} ~x~0 := #t~nondet0; {46#true} is VALID [2020-07-10 20:22:12,785 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} havoc #t~nondet0; {46#true} is VALID [2020-07-10 20:22:12,786 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {46#true} is VALID [2020-07-10 20:22:12,786 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#true} ~z~0 := #t~nondet1; {46#true} is VALID [2020-07-10 20:22:12,786 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#true} havoc #t~nondet1; {46#true} is VALID [2020-07-10 20:22:12,787 INFO L280 TraceCheckUtils]: 10: Hoare triple {46#true} assume !!(~x~0 > -100); {46#true} is VALID [2020-07-10 20:22:12,787 INFO L280 TraceCheckUtils]: 11: Hoare triple {46#true} assume !!(~x~0 < 200); {46#true} is VALID [2020-07-10 20:22:12,788 INFO L280 TraceCheckUtils]: 12: Hoare triple {46#true} assume !!(~z~0 > 100); {46#true} is VALID [2020-07-10 20:22:12,788 INFO L280 TraceCheckUtils]: 13: Hoare triple {46#true} assume !!(~z~0 < 200); {46#true} is VALID [2020-07-10 20:22:12,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {46#true} assume !true; {47#false} is VALID [2020-07-10 20:22:12,790 INFO L263 TraceCheckUtils]: 15: Hoare triple {47#false} call __VERIFIER_assert((if ~x~0 >= 100 || ~z~0 <= 100 then 1 else 0)); {47#false} is VALID [2020-07-10 20:22:12,790 INFO L280 TraceCheckUtils]: 16: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2020-07-10 20:22:12,791 INFO L280 TraceCheckUtils]: 17: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2020-07-10 20:22:12,791 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-10 20:22:12,793 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-10 20:22:12,794 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:12,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1206899759] [2020-07-10 20:22:12,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:12,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:22:12,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478398292] [2020-07-10 20:22:12,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-10 20:22:12,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:12,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:22:12,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:12,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:22:12,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:22:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:22:12,903 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2020-07-10 20:22:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:13,025 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-07-10 20:22:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:22:13,025 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-10 20:22:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2020-07-10 20:22:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2020-07-10 20:22:13,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2020-07-10 20:22:13,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:13,159 INFO L225 Difference]: With dead ends: 55 [2020-07-10 20:22:13,160 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 20:22:13,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:22:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 20:22:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 20:22:13,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:13,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 20:22:13,224 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 20:22:13,224 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 20:22:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:13,229 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-10 20:22:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 20:22:13,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:13,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:13,231 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 20:22:13,231 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 20:22:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:13,236 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-10 20:22:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 20:22:13,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:13,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:13,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:13,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 20:22:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-10 20:22:13,242 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 19 [2020-07-10 20:22:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:13,243 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-10 20:22:13,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:22:13,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-10 20:22:13,295 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-10 20:22:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-10 20:22:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 20:22:13,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:13,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:13,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:13,297 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:13,298 INFO L82 PathProgramCache]: Analyzing trace with hash 645586435, now seen corresponding path program 1 times [2020-07-10 20:22:13,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:13,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1938569394] [2020-07-10 20:22:13,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:13,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {290#true} assume true; {290#true} is VALID [2020-07-10 20:22:13,448 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {290#true} {290#true} #83#return; {290#true} is VALID [2020-07-10 20:22:13,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {290#true} call ULTIMATE.init(); {290#true} is VALID [2020-07-10 20:22:13,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {290#true} assume true; {290#true} is VALID [2020-07-10 20:22:13,449 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {290#true} {290#true} #83#return; {290#true} is VALID [2020-07-10 20:22:13,450 INFO L263 TraceCheckUtils]: 3: Hoare triple {290#true} call #t~ret6 := main(); {290#true} is VALID [2020-07-10 20:22:13,450 INFO L280 TraceCheckUtils]: 4: Hoare triple {290#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {290#true} is VALID [2020-07-10 20:22:13,450 INFO L280 TraceCheckUtils]: 5: Hoare triple {290#true} ~x~0 := #t~nondet0; {290#true} is VALID [2020-07-10 20:22:13,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {290#true} havoc #t~nondet0; {290#true} is VALID [2020-07-10 20:22:13,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {290#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {290#true} is VALID [2020-07-10 20:22:13,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {290#true} ~z~0 := #t~nondet1; {290#true} is VALID [2020-07-10 20:22:13,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {290#true} havoc #t~nondet1; {290#true} is VALID [2020-07-10 20:22:13,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {290#true} assume !!(~x~0 > -100); {290#true} is VALID [2020-07-10 20:22:13,452 INFO L280 TraceCheckUtils]: 11: Hoare triple {290#true} assume !!(~x~0 < 200); {290#true} is VALID [2020-07-10 20:22:13,453 INFO L280 TraceCheckUtils]: 12: Hoare triple {290#true} assume !!(~z~0 > 100); {294#(< 100 main_~z~0)} is VALID [2020-07-10 20:22:13,454 INFO L280 TraceCheckUtils]: 13: Hoare triple {294#(< 100 main_~z~0)} assume !!(~z~0 < 200); {294#(< 100 main_~z~0)} is VALID [2020-07-10 20:22:13,455 INFO L280 TraceCheckUtils]: 14: Hoare triple {294#(< 100 main_~z~0)} assume !(~x~0 < 100 && ~z~0 > 100); {295#(< 99 main_~x~0)} is VALID [2020-07-10 20:22:13,457 INFO L263 TraceCheckUtils]: 15: Hoare triple {295#(< 99 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= 100 || ~z~0 <= 100 then 1 else 0)); {296#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:13,458 INFO L280 TraceCheckUtils]: 16: Hoare triple {296#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {297#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:13,459 INFO L280 TraceCheckUtils]: 17: Hoare triple {297#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {291#false} is VALID [2020-07-10 20:22:13,459 INFO L280 TraceCheckUtils]: 18: Hoare triple {291#false} assume !false; {291#false} is VALID [2020-07-10 20:22:13,461 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-10 20:22:13,461 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:13,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1938569394] [2020-07-10 20:22:13,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:13,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:22:13,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469099671] [2020-07-10 20:22:13,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 20:22:13,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:13,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:22:13,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:13,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:22:13,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:13,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:22:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:22:13,490 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 6 states. [2020-07-10 20:22:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:13,727 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-10 20:22:13,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:22:13,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 20:22:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-10 20:22:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-10 20:22:13,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2020-07-10 20:22:13,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:13,785 INFO L225 Difference]: With dead ends: 38 [2020-07-10 20:22:13,785 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 20:22:13,787 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 20:22:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-10 20:22:13,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:13,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-10 20:22:13,817 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 20:22:13,818 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 20:22:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:13,821 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-10 20:22:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-10 20:22:13,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:13,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:13,822 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 20:22:13,822 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 20:22:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:13,825 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-10 20:22:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-10 20:22:13,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:13,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:13,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:13,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 20:22:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-10 20:22:13,830 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 19 [2020-07-10 20:22:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:13,830 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-10 20:22:13,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:22:13,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-10 20:22:13,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-10 20:22:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:22:13,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:13,878 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, 1, 1, 1] [2020-07-10 20:22:13,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:13,878 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1512571145, now seen corresponding path program 1 times [2020-07-10 20:22:13,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:13,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847170698] [2020-07-10 20:22:13,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:14,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-10 20:22:14,054 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {512#true} {512#true} #83#return; {512#true} is VALID [2020-07-10 20:22:14,054 INFO L263 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2020-07-10 20:22:14,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-10 20:22:14,055 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {512#true} {512#true} #83#return; {512#true} is VALID [2020-07-10 20:22:14,055 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#true} call #t~ret6 := main(); {512#true} is VALID [2020-07-10 20:22:14,056 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {512#true} is VALID [2020-07-10 20:22:14,056 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} ~x~0 := #t~nondet0; {512#true} is VALID [2020-07-10 20:22:14,056 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#true} havoc #t~nondet0; {512#true} is VALID [2020-07-10 20:22:14,059 INFO L280 TraceCheckUtils]: 7: Hoare triple {512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {512#true} is VALID [2020-07-10 20:22:14,060 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#true} ~z~0 := #t~nondet1; {512#true} is VALID [2020-07-10 20:22:14,060 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#true} havoc #t~nondet1; {512#true} is VALID [2020-07-10 20:22:14,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {512#true} assume !!(~x~0 > -100); {512#true} is VALID [2020-07-10 20:22:14,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {512#true} assume !!(~x~0 < 200); {512#true} is VALID [2020-07-10 20:22:14,061 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#true} assume !!(~z~0 > 100); {512#true} is VALID [2020-07-10 20:22:14,061 INFO L280 TraceCheckUtils]: 13: Hoare triple {512#true} assume !!(~z~0 < 200); {512#true} is VALID [2020-07-10 20:22:14,062 INFO L280 TraceCheckUtils]: 14: Hoare triple {512#true} assume !!(~x~0 < 100 && ~z~0 > 100); {512#true} is VALID [2020-07-10 20:22:14,062 INFO L280 TraceCheckUtils]: 15: Hoare triple {512#true} ~tmp~0 := #t~nondet2; {512#true} is VALID [2020-07-10 20:22:14,062 INFO L280 TraceCheckUtils]: 16: Hoare triple {512#true} havoc #t~nondet2; {512#true} is VALID [2020-07-10 20:22:14,063 INFO L280 TraceCheckUtils]: 17: Hoare triple {512#true} assume !(0 != ~tmp~0 % 256); {512#true} is VALID [2020-07-10 20:22:14,063 INFO L280 TraceCheckUtils]: 18: Hoare triple {512#true} #t~post4 := ~x~0; {512#true} is VALID [2020-07-10 20:22:14,063 INFO L280 TraceCheckUtils]: 19: Hoare triple {512#true} ~x~0 := #t~post4 - 1; {512#true} is VALID [2020-07-10 20:22:14,064 INFO L280 TraceCheckUtils]: 20: Hoare triple {512#true} havoc #t~post4; {512#true} is VALID [2020-07-10 20:22:14,064 INFO L280 TraceCheckUtils]: 21: Hoare triple {512#true} #t~post5 := ~z~0; {512#true} is VALID [2020-07-10 20:22:14,064 INFO L280 TraceCheckUtils]: 22: Hoare triple {512#true} ~z~0 := #t~post5 - 1; {512#true} is VALID [2020-07-10 20:22:14,064 INFO L280 TraceCheckUtils]: 23: Hoare triple {512#true} havoc #t~post5; {512#true} is VALID [2020-07-10 20:22:14,068 INFO L280 TraceCheckUtils]: 24: Hoare triple {512#true} assume !(~x~0 < 100 && ~z~0 > 100); {516#(or (<= main_~z~0 100) (< 99 main_~x~0))} is VALID [2020-07-10 20:22:14,069 INFO L263 TraceCheckUtils]: 25: Hoare triple {516#(or (<= main_~z~0 100) (< 99 main_~x~0))} call __VERIFIER_assert((if ~x~0 >= 100 || ~z~0 <= 100 then 1 else 0)); {517#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:14,070 INFO L280 TraceCheckUtils]: 26: Hoare triple {517#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {518#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:14,071 INFO L280 TraceCheckUtils]: 27: Hoare triple {518#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {513#false} is VALID [2020-07-10 20:22:14,071 INFO L280 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2020-07-10 20:22:14,073 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-10 20:22:14,073 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:14,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847170698] [2020-07-10 20:22:14,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:14,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:22:14,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434474845] [2020-07-10 20:22:14,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-10 20:22:14,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:14,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:14,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:14,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:14,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:14,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:14,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:14,122 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 5 states. [2020-07-10 20:22:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:14,290 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-10 20:22:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:22:14,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-10 20:22:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 20:22:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-10 20:22:14,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-10 20:22:14,333 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-10 20:22:14,333 INFO L225 Difference]: With dead ends: 33 [2020-07-10 20:22:14,334 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:14,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:22:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:14,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:14,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:14,336 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:14,336 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:14,336 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:14,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:14,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:14,337 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:14,337 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:14,338 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:14,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:14,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:14,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:14,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:14,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-10 20:22:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:14,340 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:14,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:14,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:14,341 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-10 20:22:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:14,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:14,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:14,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:14,530 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:14,530 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:14,530 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:14,531 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:14,531 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:14,531 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:14,531 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-10 20:22:14,532 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 20:22:14,532 INFO L268 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2020-07-10 20:22:14,532 INFO L268 CegarLoopResult]: For program point L5-3(lines 4 6) no Hoare annotation was computed. [2020-07-10 20:22:14,532 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 20:22:14,532 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,532 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,533 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-10 20:22:14,533 INFO L264 CegarLoopResult]: At program point L27(lines 27 32) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,533 INFO L271 CegarLoopResult]: At program point L27-2(lines 24 33) the Hoare annotation is: true [2020-07-10 20:22:14,533 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 16 38) the Hoare annotation is: true [2020-07-10 20:22:14,533 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,533 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-07-10 20:22:14,534 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 20:22:14,534 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-07-10 20:22:14,534 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-07-10 20:22:14,534 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,534 INFO L264 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,535 INFO L264 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,535 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 33) the Hoare annotation is: (or (<= main_~z~0 100) (< 99 main_~x~0)) [2020-07-10 20:22:14,535 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-10 20:22:14,535 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-10 20:22:14,535 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-10 20:22:14,535 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-10 20:22:14,536 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 16 38) the Hoare annotation is: true [2020-07-10 20:22:14,536 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,536 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 16 38) the Hoare annotation is: true [2020-07-10 20:22:14,536 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,537 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,537 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,537 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (< 100 main_~z~0) [2020-07-10 20:22:14,537 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 20:22:14,538 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-07-10 20:22:14,538 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:22:14,538 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-10 20:22:14,538 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-10 20:22:14,539 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 7 12) the Hoare annotation is: true [2020-07-10 20:22:14,539 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 7 12) the Hoare annotation is: true [2020-07-10 20:22:14,539 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:14,539 INFO L264 CegarLoopResult]: At program point L8(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:14,539 INFO L271 CegarLoopResult]: At program point L8-2(lines 7 12) the Hoare annotation is: true [2020-07-10 20:22:14,539 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:14,544 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:22:14,547 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:22:14,548 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:22:14,548 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-10 20:22:14,548 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-10 20:22:14,557 INFO L163 areAnnotationChecker]: CFG has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:22:14,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:14 BoogieIcfgContainer [2020-07-10 20:22:14,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:14,572 INFO L168 Benchmark]: Toolchain (without parser) took 2904.07 ms. Allocated memory was 144.7 MB in the beginning and 244.3 MB in the end (delta: 99.6 MB). Free memory was 103.2 MB in the beginning and 198.3 MB in the end (delta: -95.2 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:14,573 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:14,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.24 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 92.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:14,576 INFO L168 Benchmark]: Boogie Preprocessor took 129.88 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 92.9 MB in the beginning and 182.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:14,578 INFO L168 Benchmark]: RCFGBuilder took 427.59 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 159.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:14,584 INFO L168 Benchmark]: TraceAbstraction took 2044.12 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 158.6 MB in the beginning and 198.3 MB in the end (delta: -39.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:14,593 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.24 ms. Allocated memory is still 144.7 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.24 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 92.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.88 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 92.9 MB in the beginning and 182.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.59 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 159.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2044.12 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 158.6 MB in the beginning and 198.3 MB in the end (delta: -39.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 24]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 7]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 106 SDtfs, 15 SDslu, 165 SDs, 0 SdLazy, 48 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 55 PreInvPairs, 67 NumberOfFragments, 84 HoareAnnotationTreeSize, 55 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 43 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s 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...