/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/loop-invgen/id_build.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:23:59,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:23:59,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:23:59,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:23:59,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:23:59,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:23:59,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:23:59,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:23:59,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:23:59,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:23:59,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:23:59,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:23:59,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:23:59,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:23:59,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:23:59,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:23:59,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:23:59,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:23:59,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:23:59,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:23:59,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:23:59,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:23:59,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:23:59,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:23:59,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:23:59,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:23:59,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:23:59,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:23:59,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:23:59,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:23:59,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:23:59,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:23:59,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:23:59,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:23:59,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:23:59,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:23:59,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:23:59,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:23:59,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:23:59,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:23:59,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:23:59,060 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:23:59,069 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:23:59,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:23:59,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:23:59,071 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:23:59,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:23:59,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:23:59,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:23:59,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:23:59,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:23:59,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:23:59,072 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:23:59,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:23:59,073 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:23:59,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:23:59,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:23:59,073 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:23:59,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:23:59,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:23:59,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:23:59,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:23:59,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:23:59,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:23:59,075 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:23:59,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:23:59,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:23:59,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:23:59,400 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:23:59,401 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:23:59,401 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2020-07-10 20:23:59,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7853ff0c9/2da2e03987eb4c6fa44ccb9e521f8e99/FLAG141dcbda0 [2020-07-10 20:23:59,944 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:23:59,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2020-07-10 20:23:59,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7853ff0c9/2da2e03987eb4c6fa44ccb9e521f8e99/FLAG141dcbda0 [2020-07-10 20:24:00,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7853ff0c9/2da2e03987eb4c6fa44ccb9e521f8e99 [2020-07-10 20:24:00,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:00,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:00,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:00,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:00,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:00,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24aa15b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00, skipping insertion in model container [2020-07-10 20:24:00,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:00,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:00,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:00,573 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:00,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:00,612 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:24:00,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00 WrapperNode [2020-07-10 20:24:00,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:00,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:24:00,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:24:00,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:24:00,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (1/1) ... [2020-07-10 20:24:00,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:24:00,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:24:00,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:24:00,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:24:00,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (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:24:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:24:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:24:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:24:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:24:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:24:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:24:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:24:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:24:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:24:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:24:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:24:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:24:01,201 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:24:01,201 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 20:24:01,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:01 BoogieIcfgContainer [2020-07-10 20:24:01,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:24:01,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:24:01,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:24:01,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:24:01,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:00" (1/3) ... [2020-07-10 20:24:01,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a38b189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:01, skipping insertion in model container [2020-07-10 20:24:01,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:00" (2/3) ... [2020-07-10 20:24:01,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a38b189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:01, skipping insertion in model container [2020-07-10 20:24:01,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:01" (3/3) ... [2020-07-10 20:24:01,214 INFO L109 eAbstractionObserver]: Analyzing ICFG id_build.i.v+lhb-reducer.c [2020-07-10 20:24:01,225 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:24:01,233 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-10 20:24:01,248 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-10 20:24:01,270 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:24:01,270 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:24:01,270 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:24:01,270 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:24:01,271 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:24:01,271 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:24:01,271 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:24:01,271 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:24:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-10 20:24:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 20:24:01,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:01,299 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-10 20:24:01,300 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:01,306 INFO L82 PathProgramCache]: Analyzing trace with hash -627197159, now seen corresponding path program 1 times [2020-07-10 20:24:01,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:01,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [110156707] [2020-07-10 20:24:01,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:01,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {58#true} is VALID [2020-07-10 20:24:01,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} ~__return_100~0 := 0; {58#true} is VALID [2020-07-10 20:24:01,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 20:24:01,609 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #89#return; {58#true} is VALID [2020-07-10 20:24:01,612 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {67#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} is VALID [2020-07-10 20:24:01,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {58#true} is VALID [2020-07-10 20:24:01,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#true} ~__return_100~0 := 0; {58#true} is VALID [2020-07-10 20:24:01,614 INFO L280 TraceCheckUtils]: 3: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-10 20:24:01,614 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {58#true} {58#true} #89#return; {58#true} is VALID [2020-07-10 20:24:01,615 INFO L263 TraceCheckUtils]: 5: Hoare triple {58#true} call #t~ret1 := main(); {58#true} is VALID [2020-07-10 20:24:01,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} havoc ~main__offset~0; {58#true} is VALID [2020-07-10 20:24:01,615 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} havoc ~main__length~0; {58#true} is VALID [2020-07-10 20:24:01,616 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} havoc ~main__nlen~0; {58#true} is VALID [2020-07-10 20:24:01,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-10 20:24:01,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} ~main__nlen~0 := #t~nondet0; {58#true} is VALID [2020-07-10 20:24:01,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-10 20:24:01,617 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~main__i~0; {58#true} is VALID [2020-07-10 20:24:01,618 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} havoc ~main__j~0; {58#true} is VALID [2020-07-10 20:24:01,618 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} ~main__i~0 := 0; {58#true} is VALID [2020-07-10 20:24:01,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} assume ~main__i~0 < ~main__nlen~0; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-10 20:24:01,621 INFO L280 TraceCheckUtils]: 16: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} ~main__j~0 := 0; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-10 20:24:01,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} assume ~main__j~0 < 8; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-10 20:24:01,623 INFO L280 TraceCheckUtils]: 18: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} havoc ~__tmp_1~0; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-10 20:24:01,625 INFO L280 TraceCheckUtils]: 19: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} ~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {65#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-10 20:24:01,627 INFO L280 TraceCheckUtils]: 20: Hoare triple {65#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {65#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-10 20:24:01,628 INFO L280 TraceCheckUtils]: 21: Hoare triple {65#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {66#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-10 20:24:01,630 INFO L280 TraceCheckUtils]: 22: Hoare triple {66#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {59#false} is VALID [2020-07-10 20:24:01,630 INFO L280 TraceCheckUtils]: 23: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-10 20:24:01,636 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:24:01,636 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:01,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [110156707] [2020-07-10 20:24:01,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:01,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:24:01,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017901102] [2020-07-10 20:24:01,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-10 20:24:01,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:01,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:24:01,701 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-10 20:24:01,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:24:01,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:01,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:24:01,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:01,714 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 6 states. [2020-07-10 20:24:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:02,360 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-10 20:24:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:24:02,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-10 20:24:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-10 20:24:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-10 20:24:02,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2020-07-10 20:24:02,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:02,486 INFO L225 Difference]: With dead ends: 61 [2020-07-10 20:24:02,486 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 20:24:02,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:24:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 20:24:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-10 20:24:02,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:02,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-10 20:24:02,645 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 20:24:02,645 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 20:24:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:02,651 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 20:24:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 20:24:02,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:02,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:02,652 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 20:24:02,653 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 20:24:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:02,658 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 20:24:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 20:24:02,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:02,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:02,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:02,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 20:24:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-07-10 20:24:02,666 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 24 [2020-07-10 20:24:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:02,667 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-07-10 20:24:02,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:24:02,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2020-07-10 20:24:02,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 20:24:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:24:02,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:02,744 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:24:02,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:24:02,745 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1662596629, now seen corresponding path program 1 times [2020-07-10 20:24:02,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:02,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884810842] [2020-07-10 20:24:02,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:02,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {383#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {374#true} is VALID [2020-07-10 20:24:02,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {374#true} ~__return_100~0 := 0; {374#true} is VALID [2020-07-10 20:24:02,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2020-07-10 20:24:02,917 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #89#return; {374#true} is VALID [2020-07-10 20:24:02,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {383#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} is VALID [2020-07-10 20:24:02,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {383#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {374#true} is VALID [2020-07-10 20:24:02,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {374#true} ~__return_100~0 := 0; {374#true} is VALID [2020-07-10 20:24:02,922 INFO L280 TraceCheckUtils]: 3: Hoare triple {374#true} assume true; {374#true} is VALID [2020-07-10 20:24:02,922 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {374#true} {374#true} #89#return; {374#true} is VALID [2020-07-10 20:24:02,922 INFO L263 TraceCheckUtils]: 5: Hoare triple {374#true} call #t~ret1 := main(); {374#true} is VALID [2020-07-10 20:24:02,923 INFO L280 TraceCheckUtils]: 6: Hoare triple {374#true} havoc ~main__offset~0; {374#true} is VALID [2020-07-10 20:24:02,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {374#true} havoc ~main__length~0; {374#true} is VALID [2020-07-10 20:24:02,924 INFO L280 TraceCheckUtils]: 8: Hoare triple {374#true} havoc ~main__nlen~0; {374#true} is VALID [2020-07-10 20:24:02,924 INFO L280 TraceCheckUtils]: 9: Hoare triple {374#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {374#true} is VALID [2020-07-10 20:24:02,925 INFO L280 TraceCheckUtils]: 10: Hoare triple {374#true} ~main__nlen~0 := #t~nondet0; {374#true} is VALID [2020-07-10 20:24:02,925 INFO L280 TraceCheckUtils]: 11: Hoare triple {374#true} havoc #t~nondet0; {374#true} is VALID [2020-07-10 20:24:02,926 INFO L280 TraceCheckUtils]: 12: Hoare triple {374#true} havoc ~main__i~0; {374#true} is VALID [2020-07-10 20:24:02,926 INFO L280 TraceCheckUtils]: 13: Hoare triple {374#true} havoc ~main__j~0; {374#true} is VALID [2020-07-10 20:24:02,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {374#true} ~main__i~0 := 0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,929 INFO L280 TraceCheckUtils]: 15: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} assume ~main__i~0 < ~main__nlen~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,931 INFO L280 TraceCheckUtils]: 16: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~main__j~0 := 0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,932 INFO L280 TraceCheckUtils]: 17: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} assume ~main__j~0 < 8; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,935 INFO L280 TraceCheckUtils]: 18: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} havoc ~__tmp_1~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,940 INFO L280 TraceCheckUtils]: 19: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,941 INFO L280 TraceCheckUtils]: 20: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} havoc ~__VERIFIER_assert__cond~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,942 INFO L280 TraceCheckUtils]: 21: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,943 INFO L280 TraceCheckUtils]: 22: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0); {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,945 INFO L280 TraceCheckUtils]: 23: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} havoc ~__tmp_2~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-10 20:24:02,946 INFO L280 TraceCheckUtils]: 24: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0); {381#(not (= 0 main_~__tmp_2~0))} is VALID [2020-07-10 20:24:02,949 INFO L280 TraceCheckUtils]: 25: Hoare triple {381#(not (= 0 main_~__tmp_2~0))} havoc ~__VERIFIER_assert__cond~1; {381#(not (= 0 main_~__tmp_2~0))} is VALID [2020-07-10 20:24:02,950 INFO L280 TraceCheckUtils]: 26: Hoare triple {381#(not (= 0 main_~__tmp_2~0))} ~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {382#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2020-07-10 20:24:02,951 INFO L280 TraceCheckUtils]: 27: Hoare triple {382#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {375#false} is VALID [2020-07-10 20:24:02,951 INFO L280 TraceCheckUtils]: 28: Hoare triple {375#false} assume !false; {375#false} is VALID [2020-07-10 20:24:02,956 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:24:02,957 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:02,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884810842] [2020-07-10 20:24:02,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:02,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:24:02,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054393098] [2020-07-10 20:24:02,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 20:24:02,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:02,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:24:03,010 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:24:03,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:24:03,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:03,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:24:03,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:24:03,012 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 6 states. [2020-07-10 20:24:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:03,453 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-10 20:24:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:24:03,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 20:24:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2020-07-10 20:24:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:24:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2020-07-10 20:24:03,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2020-07-10 20:24:03,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:03,525 INFO L225 Difference]: With dead ends: 46 [2020-07-10 20:24:03,525 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 20:24:03,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 20:24:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-10 20:24:03,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:03,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2020-07-10 20:24:03,662 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2020-07-10 20:24:03,662 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2020-07-10 20:24:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:03,665 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-10 20:24:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-10 20:24:03,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:03,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:03,667 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2020-07-10 20:24:03,667 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2020-07-10 20:24:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:03,670 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-10 20:24:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-10 20:24:03,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:03,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:03,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:03,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 20:24:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-10 20:24:03,675 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 29 [2020-07-10 20:24:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:03,675 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-10 20:24:03,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:24:03,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2020-07-10 20:24:03,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 20:24:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 20:24:03,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:03,742 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:03,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:24:03,742 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:03,743 INFO L82 PathProgramCache]: Analyzing trace with hash 792220297, now seen corresponding path program 1 times [2020-07-10 20:24:03,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:03,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [447506317] [2020-07-10 20:24:03,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:03,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {656#true} is VALID [2020-07-10 20:24:03,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#true} ~__return_100~0 := 0; {656#true} is VALID [2020-07-10 20:24:03,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-10 20:24:03,936 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} #89#return; {656#true} is VALID [2020-07-10 20:24:03,937 INFO L263 TraceCheckUtils]: 0: Hoare triple {656#true} call ULTIMATE.init(); {667#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} is VALID [2020-07-10 20:24:03,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {656#true} is VALID [2020-07-10 20:24:03,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} ~__return_100~0 := 0; {656#true} is VALID [2020-07-10 20:24:03,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-10 20:24:03,939 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {656#true} {656#true} #89#return; {656#true} is VALID [2020-07-10 20:24:03,939 INFO L263 TraceCheckUtils]: 5: Hoare triple {656#true} call #t~ret1 := main(); {656#true} is VALID [2020-07-10 20:24:03,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {656#true} havoc ~main__offset~0; {656#true} is VALID [2020-07-10 20:24:03,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {656#true} havoc ~main__length~0; {656#true} is VALID [2020-07-10 20:24:03,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {656#true} havoc ~main__nlen~0; {656#true} is VALID [2020-07-10 20:24:03,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {656#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {656#true} is VALID [2020-07-10 20:24:03,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {656#true} ~main__nlen~0 := #t~nondet0; {656#true} is VALID [2020-07-10 20:24:03,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {656#true} havoc #t~nondet0; {656#true} is VALID [2020-07-10 20:24:03,942 INFO L280 TraceCheckUtils]: 12: Hoare triple {656#true} havoc ~main__i~0; {656#true} is VALID [2020-07-10 20:24:03,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {656#true} havoc ~main__j~0; {656#true} is VALID [2020-07-10 20:24:03,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {656#true} ~main__i~0 := 0; {656#true} is VALID [2020-07-10 20:24:03,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {656#true} assume ~main__i~0 < ~main__nlen~0; {656#true} is VALID [2020-07-10 20:24:03,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {656#true} ~main__j~0 := 0; {656#true} is VALID [2020-07-10 20:24:03,944 INFO L280 TraceCheckUtils]: 17: Hoare triple {656#true} assume ~main__j~0 < 8; {656#true} is VALID [2020-07-10 20:24:03,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {656#true} havoc ~__tmp_1~0; {656#true} is VALID [2020-07-10 20:24:03,946 INFO L280 TraceCheckUtils]: 19: Hoare triple {656#true} ~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} is VALID [2020-07-10 20:24:03,946 INFO L280 TraceCheckUtils]: 20: Hoare triple {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} havoc ~__VERIFIER_assert__cond~0; {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} is VALID [2020-07-10 20:24:03,948 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {663#(or (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= 1 main_~__VERIFIER_assert__cond~0)) (and (= 0 main_~__VERIFIER_assert__cond~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} is VALID [2020-07-10 20:24:03,949 INFO L280 TraceCheckUtils]: 22: Hoare triple {663#(or (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= 1 main_~__VERIFIER_assert__cond~0)) (and (= 0 main_~__VERIFIER_assert__cond~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~0); {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,949 INFO L280 TraceCheckUtils]: 23: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__tmp_2~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,950 INFO L280 TraceCheckUtils]: 24: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0); {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,951 INFO L280 TraceCheckUtils]: 25: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__VERIFIER_assert__cond~1; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,952 INFO L280 TraceCheckUtils]: 26: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,952 INFO L280 TraceCheckUtils]: 27: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume !(0 == ~__VERIFIER_assert__cond~1); {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,953 INFO L280 TraceCheckUtils]: 28: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~main__j~0 := 1 + ~main__j~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,954 INFO L280 TraceCheckUtils]: 29: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume ~main__j~0 < 8; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,954 INFO L280 TraceCheckUtils]: 30: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__tmp_3~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-10 20:24:03,955 INFO L280 TraceCheckUtils]: 31: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~__tmp_3~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {665#(not (= 0 main_~__tmp_3~0))} is VALID [2020-07-10 20:24:03,956 INFO L280 TraceCheckUtils]: 32: Hoare triple {665#(not (= 0 main_~__tmp_3~0))} havoc ~__VERIFIER_assert__cond~2; {665#(not (= 0 main_~__tmp_3~0))} is VALID [2020-07-10 20:24:03,957 INFO L280 TraceCheckUtils]: 33: Hoare triple {665#(not (= 0 main_~__tmp_3~0))} ~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {666#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2020-07-10 20:24:03,957 INFO L280 TraceCheckUtils]: 34: Hoare triple {666#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {657#false} is VALID [2020-07-10 20:24:03,958 INFO L280 TraceCheckUtils]: 35: Hoare triple {657#false} assume !false; {657#false} is VALID [2020-07-10 20:24:03,961 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:24:03,962 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:03,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [447506317] [2020-07-10 20:24:03,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:03,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:24:03,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863841183] [2020-07-10 20:24:03,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-10 20:24:03,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:03,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:24:04,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:04,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:24:04,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:24:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:04,010 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2020-07-10 20:24:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:05,224 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-07-10 20:24:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:24:05,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-10 20:24:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2020-07-10 20:24:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2020-07-10 20:24:05,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2020-07-10 20:24:05,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:05,335 INFO L225 Difference]: With dead ends: 72 [2020-07-10 20:24:05,336 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:24:05,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:24:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:24:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:24:05,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:05,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:05,338 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:05,338 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:05,338 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:05,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:05,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:05,339 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:05,339 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:05,339 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:05,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:05,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:05,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:05,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:24:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:24:05,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-10 20:24:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:05,341 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:24:05,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:24:05,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:24:05,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:24:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:05,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:05,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:24:05,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:24:06,720 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:06,720 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-10 20:24:06,720 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|)) [2020-07-10 20:24:06,721 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:06,721 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:06,721 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:24:06,721 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:24:06,721 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:06,721 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-10 20:24:06,722 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 20:24:06,722 INFO L268 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2020-07-10 20:24:06,722 INFO L268 CegarLoopResult]: For program point L5-3(lines 4 6) no Hoare annotation was computed. [2020-07-10 20:24:06,722 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 20:24:06,722 INFO L264 CegarLoopResult]: At program point L31(lines 31 87) the Hoare annotation is: (and (= 1 main_~__tmp_1~0) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (= 1 main_~__VERIFIER_assert__cond~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,722 INFO L264 CegarLoopResult]: At program point L93(lines 12 100) the Hoare annotation is: (and (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,723 INFO L264 CegarLoopResult]: At program point L60(lines 60 68) the Hoare annotation is: (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,723 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,723 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 100) the Hoare annotation is: (or (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (not (= 0 main_~__tmp_1~0))) (= |old(~__return_100~0)| ~__return_100~0)) [2020-07-10 20:24:06,723 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,724 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,724 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,724 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_1~0))) [2020-07-10 20:24:06,724 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,724 INFO L264 CegarLoopResult]: At program point L77(lines 50 85) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,724 INFO L264 CegarLoopResult]: At program point L44(lines 44 85) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse4 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 .cse3 (not (= 0 main_~__tmp_1~0)) .cse4) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 .cse3 (= 1 main_~__VERIFIER_assert__cond~0) .cse4))) [2020-07-10 20:24:06,725 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,725 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,725 INFO L264 CegarLoopResult]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 62) the Hoare annotation is: false [2020-07-10 20:24:06,725 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,725 INFO L264 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L24(lines 24 94) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (not (= 0 main_~__tmp_1~0))) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L74(lines 74 83) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (< 0 (+ main_~main__i~0 1)))) (or (and (= 1 main_~__tmp_1~0) .cse0 .cse1 (= 1 main_~__VERIFIER_assert__cond~0) .cse2) (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 (not (= 0 main_~__tmp_1~0)) .cse2))) [2020-07-10 20:24:06,726 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: false [2020-07-10 20:24:06,727 INFO L264 CegarLoopResult]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 46) the Hoare annotation is: false [2020-07-10 20:24:06,727 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: false [2020-07-10 20:24:06,727 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (= 1 main_~__tmp_1~0) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,727 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,727 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,727 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-07-10 20:24:06,727 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 11 100) the Hoare annotation is: (or (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (not (= 0 main_~__tmp_1~0))) (= |old(~__return_100~0)| ~__return_100~0)) [2020-07-10 20:24:06,728 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 (not (= 0 main_~__tmp_1~0)) .cse3) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 (= 1 main_~__VERIFIER_assert__cond~0) .cse3))) [2020-07-10 20:24:06,728 INFO L264 CegarLoopResult]: At program point L67(lines 37 87) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (< 0 (+ main_~main__i~0 1)))) (or (and (= 1 main_~__tmp_1~0) .cse0 .cse1 (= 1 main_~__VERIFIER_assert__cond~0) .cse2) (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 (not (= 0 main_~__tmp_1~0)) .cse2))) [2020-07-10 20:24:06,728 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-10 20:24:06,728 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) the Hoare annotation is: false [2020-07-10 20:24:06,728 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: false [2020-07-10 20:24:06,729 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (= 1 main_~__tmp_1~0) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,729 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 100) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,729 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,729 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,730 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse4 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 .cse3 (not (= 0 main_~__tmp_1~0)) .cse4) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 .cse3 (= 1 main_~__VERIFIER_assert__cond~0) .cse4))) [2020-07-10 20:24:06,730 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,730 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: false [2020-07-10 20:24:06,730 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-10 20:24:06,730 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-10 20:24:06,730 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 (not (= 0 main_~__tmp_1~0)) .cse3) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 (= 1 main_~__VERIFIER_assert__cond~0) .cse3))) [2020-07-10 20:24:06,736 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:24:06,737 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:24:06,737 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:24:06,738 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-10 20:24:06,738 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-10 20:24:06,766 INFO L163 areAnnotationChecker]: CFG has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:24:06,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:24:06 BoogieIcfgContainer [2020-07-10 20:24:06,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:24:06,786 INFO L168 Benchmark]: Toolchain (without parser) took 6458.51 ms. Allocated memory was 138.4 MB in the beginning and 300.9 MB in the end (delta: 162.5 MB). Free memory was 102.1 MB in the beginning and 229.1 MB in the end (delta: -126.9 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:06,787 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 20:24:06,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.39 ms. Allocated memory is still 138.4 MB. Free memory was 101.7 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:06,789 INFO L168 Benchmark]: Boogie Preprocessor took 125.32 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.5 MB in the beginning and 180.7 MB in the end (delta: -89.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:06,790 INFO L168 Benchmark]: RCFGBuilder took 466.83 ms. Allocated memory is still 201.9 MB. Free memory was 180.7 MB in the beginning and 156.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:06,791 INFO L168 Benchmark]: TraceAbstraction took 5576.33 ms. Allocated memory was 201.9 MB in the beginning and 300.9 MB in the end (delta: 99.1 MB). Free memory was 155.9 MB in the beginning and 229.1 MB in the end (delta: -73.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:06,795 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.89 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.39 ms. Allocated memory is still 138.4 MB. Free memory was 101.7 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.32 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.5 MB in the beginning and 180.7 MB in the end (delta: -89.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.83 ms. Allocated memory is still 201.9 MB. Free memory was 180.7 MB in the beginning and 156.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5576.33 ms. Allocated memory was 201.9 MB in the beginning and 300.9 MB in the end (delta: 99.1 MB). Free memory was 155.9 MB in the beginning and 229.1 MB in the end (delta: -73.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 62]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 46]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: \old(__return_100) == __return_100 && 0 < main__i + 1 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((!(0 == __VERIFIER_assert__cond) && main__i < main__nlen) && \old(__return_100) == __return_100) && !(0 == __tmp_2)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __tmp_1)) && 0 < main__i + 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((1 == __tmp_1 && main__i < main__nlen) && \old(__return_100) == __return_100) && 1 == __VERIFIER_assert__cond) && 0 < main__i + 1) || ((((((!(0 == __tmp_3) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__i < main__nlen) && \old(__return_100) == __return_100) && !(0 == __tmp_1)) && 0 < main__i + 1) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: (!(0 == __VERIFIER_assert__cond) && !(0 == __tmp_1)) || \old(__return_100) == __return_100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 60 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 126 SDtfs, 333 SDslu, 85 SDs, 0 SdLazy, 304 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 55 PreInvPairs, 92 NumberOfFragments, 812 HoareAnnotationTreeSize, 55 FomulaSimplifications, 1452 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 55 FomulaSimplificationsInter, 432 FormulaSimplificationTreeSizeReductionInter, 1.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...