/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:25,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:25,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:25,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:25,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:25,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:25,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:25,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:25,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:25,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:25,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:25,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:25,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:25,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:25,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:25,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:25,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:25,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:25,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:25,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:25,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:25,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:25,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:25,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:25,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:25,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:25,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:25,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:25,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:25,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:25,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:25,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:25,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:25,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:25,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:25,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:25,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:25,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:25,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:25,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:25,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:25,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:25,747 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:25,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:25,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:25,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:25,750 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:25,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:25,750 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:25,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:25,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:25,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:25,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:25,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:25,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:25,752 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:25,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:25,752 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:25,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:25,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:25,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:25,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:25,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:25,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:25,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:25,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:25,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:25,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:25,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:25,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:25,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:25,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:26,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:26,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:26,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:26,091 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:26,091 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:26,092 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-07-10 15:28:26,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0813ac105/1695fd8ced4545749e2449068ba6a5aa/FLAG0be259af6 [2020-07-10 15:28:26,882 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:26,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-07-10 15:28:26,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0813ac105/1695fd8ced4545749e2449068ba6a5aa/FLAG0be259af6 [2020-07-10 15:28:27,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0813ac105/1695fd8ced4545749e2449068ba6a5aa [2020-07-10 15:28:27,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:27,200 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:27,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:27,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:27,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:27,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d0c752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27, skipping insertion in model container [2020-07-10 15:28:27,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:27,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:27,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:27,564 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:27,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:27,632 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:27,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27 WrapperNode [2020-07-10 15:28:27,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:27,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:27,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:27,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:27,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (1/1) ... [2020-07-10 15:28:27,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:27,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:27,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:27,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:27,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (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 15:28:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:28:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:28:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:28:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:28,624 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:28,624 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:28:28,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:28 BoogieIcfgContainer [2020-07-10 15:28:28,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:28,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:28,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:28,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:28,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:27" (1/3) ... [2020-07-10 15:28:28,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b4a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:28, skipping insertion in model container [2020-07-10 15:28:28,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:27" (2/3) ... [2020-07-10 15:28:28,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b4a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:28, skipping insertion in model container [2020-07-10 15:28:28,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:28" (3/3) ... [2020-07-10 15:28:28,647 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2020-07-10 15:28:28,663 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:28,679 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-10 15:28:28,700 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-10 15:28:28,741 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:28,741 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:28,741 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:28,742 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:28,742 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:28,742 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:28,742 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:28,743 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-10 15:28:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:28:28,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:28,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:28,796 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1781845407, now seen corresponding path program 1 times [2020-07-10 15:28:28,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:28,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121026335] [2020-07-10 15:28:28,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2020-07-10 15:28:29,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 15:28:29,146 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} #147#return; {68#true} is VALID [2020-07-10 15:28:29,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:29,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2020-07-10 15:28:29,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 15:28:29,155 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #147#return; {68#true} is VALID [2020-07-10 15:28:29,156 INFO L263 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret3 := main(); {68#true} is VALID [2020-07-10 15:28:29,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {68#true} is VALID [2020-07-10 15:28:29,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {68#true} is VALID [2020-07-10 15:28:29,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {68#true} is VALID [2020-07-10 15:28:29,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2020-07-10 15:28:29,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2020-07-10 15:28:29,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {73#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-10 15:28:29,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {73#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {69#false} is VALID [2020-07-10 15:28:29,164 INFO L280 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-10 15:28:29,166 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 15:28:29,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121026335] [2020-07-10 15:28:29,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:29,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:28:29,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620658579] [2020-07-10 15:28:29,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-10 15:28:29,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:29,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:28:29,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:29,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:28:29,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:28:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:29,248 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2020-07-10 15:28:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:29,814 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2020-07-10 15:28:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:29,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-10 15:28:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2020-07-10 15:28:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2020-07-10 15:28:29,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2020-07-10 15:28:30,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:30,114 INFO L225 Difference]: With dead ends: 90 [2020-07-10 15:28:30,116 INFO L226 Difference]: Without dead ends: 76 [2020-07-10 15:28:30,128 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-10 15:28:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2020-07-10 15:28:30,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:30,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 59 states. [2020-07-10 15:28:30,230 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 59 states. [2020-07-10 15:28:30,233 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 59 states. [2020-07-10 15:28:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,242 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-07-10 15:28:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-07-10 15:28:30,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:30,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:30,244 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 76 states. [2020-07-10 15:28:30,244 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 76 states. [2020-07-10 15:28:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,253 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-07-10 15:28:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-07-10 15:28:30,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:30,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:30,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:30,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 15:28:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-07-10 15:28:30,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2020-07-10 15:28:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:30,262 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-10 15:28:30,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:28:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-10 15:28:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:28:30,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:30,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:30,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:30,264 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -594195383, now seen corresponding path program 1 times [2020-07-10 15:28:30,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:30,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133945246] [2020-07-10 15:28:30,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:30,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {398#true} is VALID [2020-07-10 15:28:30,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {398#true} assume true; {398#true} is VALID [2020-07-10 15:28:30,364 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} #147#return; {398#true} is VALID [2020-07-10 15:28:30,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {398#true} call ULTIMATE.init(); {405#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:30,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {398#true} is VALID [2020-07-10 15:28:30,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2020-07-10 15:28:30,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #147#return; {398#true} is VALID [2020-07-10 15:28:30,367 INFO L263 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret3 := main(); {398#true} is VALID [2020-07-10 15:28:30,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {398#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {398#true} is VALID [2020-07-10 15:28:30,368 INFO L280 TraceCheckUtils]: 6: Hoare triple {398#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {398#true} is VALID [2020-07-10 15:28:30,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {398#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:30,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume ~main__i~0 < ~main__len~0; {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:30,371 INFO L280 TraceCheckUtils]: 9: Hoare triple {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume ~main__j~0 < ~main__limit~0; {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:30,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume !(1 + ~main__i~0 < ~main__len~0); {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:30,374 INFO L280 TraceCheckUtils]: 11: Hoare triple {403#(<= (+ main_~main__i~0 1) main_~main__len~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {404#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2020-07-10 15:28:30,375 INFO L280 TraceCheckUtils]: 12: Hoare triple {404#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {399#false} is VALID [2020-07-10 15:28:30,375 INFO L280 TraceCheckUtils]: 13: Hoare triple {399#false} assume !false; {399#false} is VALID [2020-07-10 15:28:30,376 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 15:28:30,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133945246] [2020-07-10 15:28:30,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:30,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:30,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560122890] [2020-07-10 15:28:30,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:28:30,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:30,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:30,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:30,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:30,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:30,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:30,407 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2020-07-10 15:28:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,159 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2020-07-10 15:28:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:31,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:28:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-10 15:28:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:31,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-10 15:28:31,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2020-07-10 15:28:31,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:31,426 INFO L225 Difference]: With dead ends: 153 [2020-07-10 15:28:31,426 INFO L226 Difference]: Without dead ends: 101 [2020-07-10 15:28:31,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-10 15:28:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2020-07-10 15:28:31,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:31,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 58 states. [2020-07-10 15:28:31,455 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 58 states. [2020-07-10 15:28:31,455 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 58 states. [2020-07-10 15:28:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,461 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-10 15:28:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-10 15:28:31,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,463 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 101 states. [2020-07-10 15:28:31,464 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 101 states. [2020-07-10 15:28:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,470 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-10 15:28:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-10 15:28:31,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:31,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:28:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2020-07-10 15:28:31,476 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2020-07-10 15:28:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:31,476 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2020-07-10 15:28:31,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2020-07-10 15:28:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:28:31,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:31,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:31,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:31,479 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash -597364152, now seen corresponding path program 1 times [2020-07-10 15:28:31,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:31,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540488144] [2020-07-10 15:28:31,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {852#true} is VALID [2020-07-10 15:28:31,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-10 15:28:31,595 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {852#true} {852#true} #147#return; {852#true} is VALID [2020-07-10 15:28:31,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:31,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {852#true} is VALID [2020-07-10 15:28:31,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-10 15:28:31,597 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} #147#return; {852#true} is VALID [2020-07-10 15:28:31,597 INFO L263 TraceCheckUtils]: 4: Hoare triple {852#true} call #t~ret3 := main(); {852#true} is VALID [2020-07-10 15:28:31,597 INFO L280 TraceCheckUtils]: 5: Hoare triple {852#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {852#true} is VALID [2020-07-10 15:28:31,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {852#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {857#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:31,599 INFO L280 TraceCheckUtils]: 7: Hoare triple {857#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {857#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:31,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {857#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {857#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:31,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {857#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {857#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:31,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {857#(<= 0 main_~main__i~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {857#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:31,601 INFO L280 TraceCheckUtils]: 11: Hoare triple {857#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {858#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2020-07-10 15:28:31,602 INFO L280 TraceCheckUtils]: 12: Hoare triple {858#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {853#false} is VALID [2020-07-10 15:28:31,602 INFO L280 TraceCheckUtils]: 13: Hoare triple {853#false} assume !false; {853#false} is VALID [2020-07-10 15:28:31,603 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 15:28:31,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540488144] [2020-07-10 15:28:31,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:31,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:31,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72544398] [2020-07-10 15:28:31,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:28:31,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:31,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:31,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:31,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:31,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:31,628 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2020-07-10 15:28:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,045 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-07-10 15:28:32,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:32,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:28:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2020-07-10 15:28:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2020-07-10 15:28:32,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2020-07-10 15:28:32,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:32,188 INFO L225 Difference]: With dead ends: 75 [2020-07-10 15:28:32,188 INFO L226 Difference]: Without dead ends: 73 [2020-07-10 15:28:32,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-10 15:28:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2020-07-10 15:28:32,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:32,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 56 states. [2020-07-10 15:28:32,229 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 56 states. [2020-07-10 15:28:32,229 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 56 states. [2020-07-10 15:28:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,236 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-10 15:28:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-10 15:28:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,239 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 73 states. [2020-07-10 15:28:32,239 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 73 states. [2020-07-10 15:28:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,243 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-10 15:28:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-10 15:28:32,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:32,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:28:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-10 15:28:32,250 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2020-07-10 15:28:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:32,250 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-10 15:28:32,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-10 15:28:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:28:32,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:32,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:32,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:28:32,252 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:32,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1240184593, now seen corresponding path program 1 times [2020-07-10 15:28:32,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:32,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152355473] [2020-07-10 15:28:32,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {1170#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {1163#true} is VALID [2020-07-10 15:28:32,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {1163#true} assume true; {1163#true} is VALID [2020-07-10 15:28:32,342 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1163#true} {1163#true} #147#return; {1163#true} is VALID [2020-07-10 15:28:32,343 INFO L263 TraceCheckUtils]: 0: Hoare triple {1163#true} call ULTIMATE.init(); {1170#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:32,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {1170#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {1163#true} is VALID [2020-07-10 15:28:32,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {1163#true} assume true; {1163#true} is VALID [2020-07-10 15:28:32,345 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1163#true} {1163#true} #147#return; {1163#true} is VALID [2020-07-10 15:28:32,345 INFO L263 TraceCheckUtils]: 4: Hoare triple {1163#true} call #t~ret3 := main(); {1163#true} is VALID [2020-07-10 15:28:32,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {1163#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {1163#true} is VALID [2020-07-10 15:28:32,347 INFO L280 TraceCheckUtils]: 6: Hoare triple {1163#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1168#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:32,347 INFO L280 TraceCheckUtils]: 7: Hoare triple {1168#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1168#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:32,348 INFO L280 TraceCheckUtils]: 8: Hoare triple {1168#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {1168#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:32,349 INFO L280 TraceCheckUtils]: 9: Hoare triple {1168#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {1168#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:32,350 INFO L280 TraceCheckUtils]: 10: Hoare triple {1168#(<= 0 main_~main__i~0)} assume !(1 + ~main__i~0 < ~main__len~0); {1168#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:32,351 INFO L280 TraceCheckUtils]: 11: Hoare triple {1168#(<= 0 main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1168#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:32,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {1168#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1169#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2020-07-10 15:28:32,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {1169#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume 0 == ~__VERIFIER_assert__cond~3; {1164#false} is VALID [2020-07-10 15:28:32,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {1164#false} assume !false; {1164#false} is VALID [2020-07-10 15:28:32,354 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 15:28:32,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152355473] [2020-07-10 15:28:32,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:32,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:32,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124331945] [2020-07-10 15:28:32,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:28:32,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:32,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:32,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:32,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:32,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:32,376 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-07-10 15:28:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,842 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2020-07-10 15:28:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:32,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:28:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2020-07-10 15:28:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2020-07-10 15:28:32,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2020-07-10 15:28:33,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:33,024 INFO L225 Difference]: With dead ends: 96 [2020-07-10 15:28:33,024 INFO L226 Difference]: Without dead ends: 94 [2020-07-10 15:28:33,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-10 15:28:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2020-07-10 15:28:33,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:33,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 54 states. [2020-07-10 15:28:33,066 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 54 states. [2020-07-10 15:28:33,066 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 54 states. [2020-07-10 15:28:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,071 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2020-07-10 15:28:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-10 15:28:33,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,072 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 94 states. [2020-07-10 15:28:33,073 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 94 states. [2020-07-10 15:28:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,077 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2020-07-10 15:28:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-10 15:28:33,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:33,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 15:28:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-07-10 15:28:33,082 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2020-07-10 15:28:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:33,082 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-07-10 15:28:33,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-10 15:28:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:28:33,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:33,083 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:33,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:28:33,084 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash 208986383, now seen corresponding path program 1 times [2020-07-10 15:28:33,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:33,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067715862] [2020-07-10 15:28:33,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {1543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {1535#true} is VALID [2020-07-10 15:28:33,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-10 15:28:33,191 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1535#true} {1535#true} #147#return; {1535#true} is VALID [2020-07-10 15:28:33,192 INFO L263 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:33,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {1543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {1535#true} is VALID [2020-07-10 15:28:33,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-10 15:28:33,193 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #147#return; {1535#true} is VALID [2020-07-10 15:28:33,193 INFO L263 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret3 := main(); {1535#true} is VALID [2020-07-10 15:28:33,194 INFO L280 TraceCheckUtils]: 5: Hoare triple {1535#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {1535#true} is VALID [2020-07-10 15:28:33,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {1535#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:33,196 INFO L280 TraceCheckUtils]: 7: Hoare triple {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:33,197 INFO L280 TraceCheckUtils]: 8: Hoare triple {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:33,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:33,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(1 + ~main__i~0 < ~main__len~0); {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:33,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:33,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:33,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {1541#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1542#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2020-07-10 15:28:33,204 INFO L280 TraceCheckUtils]: 14: Hoare triple {1542#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {1536#false} is VALID [2020-07-10 15:28:33,204 INFO L280 TraceCheckUtils]: 15: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2020-07-10 15:28:33,205 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 15:28:33,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067715862] [2020-07-10 15:28:33,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:33,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:33,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189101770] [2020-07-10 15:28:33,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:28:33,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:33,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:33,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:33,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:33,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:33,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:33,226 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2020-07-10 15:28:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,850 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-07-10 15:28:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:33,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:28:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-10 15:28:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-10 15:28:33,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2020-07-10 15:28:34,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,023 INFO L225 Difference]: With dead ends: 95 [2020-07-10 15:28:34,023 INFO L226 Difference]: Without dead ends: 93 [2020-07-10 15:28:34,024 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 15:28:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-10 15:28:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2020-07-10 15:28:34,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:34,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 52 states. [2020-07-10 15:28:34,073 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 52 states. [2020-07-10 15:28:34,073 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 52 states. [2020-07-10 15:28:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,077 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-10 15:28:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-07-10 15:28:34,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,079 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 93 states. [2020-07-10 15:28:34,079 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 93 states. [2020-07-10 15:28:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,083 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-10 15:28:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-07-10 15:28:34,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:34,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 15:28:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-07-10 15:28:34,087 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2020-07-10 15:28:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:34,087 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-07-10 15:28:34,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-10 15:28:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:28:34,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:34,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:34,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:28:34,089 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1458792136, now seen corresponding path program 1 times [2020-07-10 15:28:34,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:34,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018907265] [2020-07-10 15:28:34,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {1914#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {1907#true} is VALID [2020-07-10 15:28:34,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 15:28:34,187 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #147#return; {1907#true} is VALID [2020-07-10 15:28:34,188 INFO L263 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1914#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:34,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {1914#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {1907#true} is VALID [2020-07-10 15:28:34,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 15:28:34,189 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #147#return; {1907#true} is VALID [2020-07-10 15:28:34,190 INFO L263 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret3 := main(); {1907#true} is VALID [2020-07-10 15:28:34,190 INFO L280 TraceCheckUtils]: 5: Hoare triple {1907#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {1907#true} is VALID [2020-07-10 15:28:34,190 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1907#true} is VALID [2020-07-10 15:28:34,192 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:34,192 INFO L280 TraceCheckUtils]: 8: Hoare triple {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume ~main__i~0 < ~main__len~0; {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:34,193 INFO L280 TraceCheckUtils]: 9: Hoare triple {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume ~main__j~0 < ~main__limit~0; {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:34,193 INFO L280 TraceCheckUtils]: 10: Hoare triple {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:34,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:34,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} is VALID [2020-07-10 15:28:34,196 INFO L280 TraceCheckUtils]: 13: Hoare triple {1912#(<= (+ main_~main__i~0 1) main_~main__len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {1913#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2020-07-10 15:28:34,198 INFO L280 TraceCheckUtils]: 14: Hoare triple {1913#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume 0 == ~__VERIFIER_assert__cond~6; {1908#false} is VALID [2020-07-10 15:28:34,198 INFO L280 TraceCheckUtils]: 15: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2020-07-10 15:28:34,199 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 15:28:34,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018907265] [2020-07-10 15:28:34,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:34,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:34,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534669285] [2020-07-10 15:28:34,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 15:28:34,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:34,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:34,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:34,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:34,225 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2020-07-10 15:28:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,688 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-10 15:28:34,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:34,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 15:28:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-10 15:28:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-10 15:28:34,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-10 15:28:34,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,815 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:28:34,815 INFO L226 Difference]: Without dead ends: 67 [2020-07-10 15:28:34,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:34,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-10 15:28:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2020-07-10 15:28:34,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:34,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 50 states. [2020-07-10 15:28:34,856 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 50 states. [2020-07-10 15:28:34,856 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 50 states. [2020-07-10 15:28:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,859 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:28:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:28:34,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,860 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 67 states. [2020-07-10 15:28:34,860 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 67 states. [2020-07-10 15:28:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,863 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:28:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:28:34,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:34,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 15:28:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-10 15:28:34,867 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2020-07-10 15:28:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:34,868 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-10 15:28:34,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-10 15:28:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:28:34,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:34,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:34,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:28:34,869 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:34,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:34,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2111353611, now seen corresponding path program 1 times [2020-07-10 15:28:34,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:34,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368106756] [2020-07-10 15:28:34,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {2205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {2198#true} is VALID [2020-07-10 15:28:34,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {2198#true} assume true; {2198#true} is VALID [2020-07-10 15:28:34,948 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2198#true} {2198#true} #147#return; {2198#true} is VALID [2020-07-10 15:28:34,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:34,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {2205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {2198#true} is VALID [2020-07-10 15:28:34,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2020-07-10 15:28:34,950 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #147#return; {2198#true} is VALID [2020-07-10 15:28:34,950 INFO L263 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret3 := main(); {2198#true} is VALID [2020-07-10 15:28:34,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {2198#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {2198#true} is VALID [2020-07-10 15:28:34,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {2198#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2198#true} is VALID [2020-07-10 15:28:34,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {2198#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2203#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:34,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {2203#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {2203#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:34,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {2203#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {2203#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:34,953 INFO L280 TraceCheckUtils]: 10: Hoare triple {2203#(<= 0 main_~main__j~0)} assume !(1 + ~main__i~0 < ~main__len~0); {2203#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:34,954 INFO L280 TraceCheckUtils]: 11: Hoare triple {2203#(<= 0 main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2203#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:34,963 INFO L280 TraceCheckUtils]: 12: Hoare triple {2203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2203#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:34,965 INFO L280 TraceCheckUtils]: 13: Hoare triple {2203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2203#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:34,966 INFO L280 TraceCheckUtils]: 14: Hoare triple {2203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {2204#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2020-07-10 15:28:34,967 INFO L280 TraceCheckUtils]: 15: Hoare triple {2204#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume 0 == ~__VERIFIER_assert__cond~5; {2199#false} is VALID [2020-07-10 15:28:34,967 INFO L280 TraceCheckUtils]: 16: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2020-07-10 15:28:34,968 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 15:28:34,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368106756] [2020-07-10 15:28:34,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:34,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:34,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890091788] [2020-07-10 15:28:34,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 15:28:34,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:34,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:34,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:35,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:35,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:35,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:35,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:35,001 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2020-07-10 15:28:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,419 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2020-07-10 15:28:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:35,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 15:28:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-10 15:28:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-10 15:28:35,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2020-07-10 15:28:35,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:35,573 INFO L225 Difference]: With dead ends: 91 [2020-07-10 15:28:35,573 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:28:35,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:28:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2020-07-10 15:28:35,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:35,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 48 states. [2020-07-10 15:28:35,618 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 48 states. [2020-07-10 15:28:35,618 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 48 states. [2020-07-10 15:28:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,622 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2020-07-10 15:28:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-10 15:28:35,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,623 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 89 states. [2020-07-10 15:28:35,623 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 89 states. [2020-07-10 15:28:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,626 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2020-07-10 15:28:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-10 15:28:35,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:35,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 15:28:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-10 15:28:35,630 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2020-07-10 15:28:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:35,631 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-10 15:28:35,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 15:28:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:28:35,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:35,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:35,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:28:35,632 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2022080917, now seen corresponding path program 1 times [2020-07-10 15:28:35,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:35,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242508666] [2020-07-10 15:28:35,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {2558#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {2550#true} is VALID [2020-07-10 15:28:35,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-10 15:28:35,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #147#return; {2550#true} is VALID [2020-07-10 15:28:35,794 INFO L263 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2558#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:35,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {2558#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {2550#true} is VALID [2020-07-10 15:28:35,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-10 15:28:35,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #147#return; {2550#true} is VALID [2020-07-10 15:28:35,795 INFO L263 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret3 := main(); {2550#true} is VALID [2020-07-10 15:28:35,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {2550#true} is VALID [2020-07-10 15:28:35,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {2550#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2550#true} is VALID [2020-07-10 15:28:35,796 INFO L280 TraceCheckUtils]: 7: Hoare triple {2550#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2550#true} is VALID [2020-07-10 15:28:35,796 INFO L280 TraceCheckUtils]: 8: Hoare triple {2550#true} assume ~main__i~0 < ~main__len~0; {2550#true} is VALID [2020-07-10 15:28:35,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {2550#true} assume ~main__j~0 < ~main__limit~0; {2550#true} is VALID [2020-07-10 15:28:35,797 INFO L280 TraceCheckUtils]: 10: Hoare triple {2550#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2550#true} is VALID [2020-07-10 15:28:35,800 INFO L280 TraceCheckUtils]: 11: Hoare triple {2550#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2555#(or (and (= 0 main_~__VERIFIER_assert__cond~1) (< main_~main__i~0 0)) (and (<= 0 main_~main__i~0) (= 1 main_~__VERIFIER_assert__cond~1)))} is VALID [2020-07-10 15:28:35,801 INFO L280 TraceCheckUtils]: 12: Hoare triple {2555#(or (and (= 0 main_~__VERIFIER_assert__cond~1) (< main_~main__i~0 0)) (and (<= 0 main_~main__i~0) (= 1 main_~__VERIFIER_assert__cond~1)))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2556#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:35,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {2556#(<= 0 main_~main__i~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2556#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:35,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {2556#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {2557#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2020-07-10 15:28:35,804 INFO L280 TraceCheckUtils]: 15: Hoare triple {2557#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume 0 == ~__VERIFIER_assert__cond~7; {2551#false} is VALID [2020-07-10 15:28:35,804 INFO L280 TraceCheckUtils]: 16: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2020-07-10 15:28:35,805 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 15:28:35,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242508666] [2020-07-10 15:28:35,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:35,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:35,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615318416] [2020-07-10 15:28:35,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:28:35,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:35,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:35,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:35,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:35,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:35,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:35,826 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2020-07-10 15:28:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,369 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-10 15:28:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:36,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:28:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2020-07-10 15:28:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2020-07-10 15:28:36,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2020-07-10 15:28:36,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:36,503 INFO L225 Difference]: With dead ends: 73 [2020-07-10 15:28:36,504 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 15:28:36,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 15:28:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-07-10 15:28:36,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:36,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 46 states. [2020-07-10 15:28:36,560 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 46 states. [2020-07-10 15:28:36,560 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 46 states. [2020-07-10 15:28:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,564 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-07-10 15:28:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-10 15:28:36,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,564 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 71 states. [2020-07-10 15:28:36,565 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 71 states. [2020-07-10 15:28:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,566 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-07-10 15:28:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-10 15:28:36,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:36,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:28:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-10 15:28:36,569 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2020-07-10 15:28:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:36,569 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-10 15:28:36,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-10 15:28:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:28:36,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:36,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:36,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:28:36,571 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1740004142, now seen corresponding path program 1 times [2020-07-10 15:28:36,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:36,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251353064] [2020-07-10 15:28:36,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:36,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {2863#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {2855#true} is VALID [2020-07-10 15:28:36,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {2855#true} assume true; {2855#true} is VALID [2020-07-10 15:28:36,668 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2855#true} {2855#true} #147#return; {2855#true} is VALID [2020-07-10 15:28:36,669 INFO L263 TraceCheckUtils]: 0: Hoare triple {2855#true} call ULTIMATE.init(); {2863#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:36,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {2863#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {2855#true} is VALID [2020-07-10 15:28:36,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {2855#true} assume true; {2855#true} is VALID [2020-07-10 15:28:36,669 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} #147#return; {2855#true} is VALID [2020-07-10 15:28:36,669 INFO L263 TraceCheckUtils]: 4: Hoare triple {2855#true} call #t~ret3 := main(); {2855#true} is VALID [2020-07-10 15:28:36,670 INFO L280 TraceCheckUtils]: 5: Hoare triple {2855#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {2855#true} is VALID [2020-07-10 15:28:36,671 INFO L280 TraceCheckUtils]: 6: Hoare triple {2855#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,672 INFO L280 TraceCheckUtils]: 7: Hoare triple {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,672 INFO L280 TraceCheckUtils]: 8: Hoare triple {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,673 INFO L280 TraceCheckUtils]: 9: Hoare triple {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,674 INFO L280 TraceCheckUtils]: 10: Hoare triple {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,676 INFO L280 TraceCheckUtils]: 12: Hoare triple {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:36,678 INFO L280 TraceCheckUtils]: 15: Hoare triple {2861#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {2862#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2020-07-10 15:28:36,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {2862#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume 0 == ~__VERIFIER_assert__cond~8; {2856#false} is VALID [2020-07-10 15:28:36,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {2856#false} assume !false; {2856#false} is VALID [2020-07-10 15:28:36,680 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 15:28:36,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251353064] [2020-07-10 15:28:36,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:36,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:36,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220132520] [2020-07-10 15:28:36,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 15:28:36,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:36,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:36,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:36,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:36,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:36,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:36,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:36,712 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2020-07-10 15:28:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,199 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-07-10 15:28:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:37,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 15:28:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-10 15:28:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-10 15:28:37,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2020-07-10 15:28:37,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:37,335 INFO L225 Difference]: With dead ends: 61 [2020-07-10 15:28:37,335 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 15:28:37,338 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 15:28:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 15:28:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2020-07-10 15:28:37,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:37,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 44 states. [2020-07-10 15:28:37,387 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 44 states. [2020-07-10 15:28:37,387 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 44 states. [2020-07-10 15:28:37,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,390 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-10 15:28:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-10 15:28:37,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:37,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:37,391 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 59 states. [2020-07-10 15:28:37,391 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 59 states. [2020-07-10 15:28:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,393 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-10 15:28:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-10 15:28:37,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:37,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:37,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:37,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 15:28:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-07-10 15:28:37,396 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2020-07-10 15:28:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:37,396 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-07-10 15:28:37,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-10 15:28:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:28:37,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:37,397 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 15:28:37,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:28:37,398 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1894443311, now seen corresponding path program 1 times [2020-07-10 15:28:37,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:37,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962490234] [2020-07-10 15:28:37,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:37,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {3124#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3117#true} is VALID [2020-07-10 15:28:37,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {3117#true} assume true; {3117#true} is VALID [2020-07-10 15:28:37,542 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3117#true} {3117#true} #147#return; {3117#true} is VALID [2020-07-10 15:28:37,544 INFO L263 TraceCheckUtils]: 0: Hoare triple {3117#true} call ULTIMATE.init(); {3124#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:37,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {3124#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3117#true} is VALID [2020-07-10 15:28:37,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {3117#true} assume true; {3117#true} is VALID [2020-07-10 15:28:37,546 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3117#true} {3117#true} #147#return; {3117#true} is VALID [2020-07-10 15:28:37,546 INFO L263 TraceCheckUtils]: 4: Hoare triple {3117#true} call #t~ret3 := main(); {3117#true} is VALID [2020-07-10 15:28:37,547 INFO L280 TraceCheckUtils]: 5: Hoare triple {3117#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {3117#true} is VALID [2020-07-10 15:28:37,547 INFO L280 TraceCheckUtils]: 6: Hoare triple {3117#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3117#true} is VALID [2020-07-10 15:28:37,548 INFO L280 TraceCheckUtils]: 7: Hoare triple {3117#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,549 INFO L280 TraceCheckUtils]: 8: Hoare triple {3122#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,550 INFO L280 TraceCheckUtils]: 9: Hoare triple {3122#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,551 INFO L280 TraceCheckUtils]: 10: Hoare triple {3122#(<= 0 main_~main__j~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {3122#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,557 INFO L280 TraceCheckUtils]: 12: Hoare triple {3122#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,557 INFO L280 TraceCheckUtils]: 13: Hoare triple {3122#(<= 0 main_~main__j~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,558 INFO L280 TraceCheckUtils]: 14: Hoare triple {3122#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,559 INFO L280 TraceCheckUtils]: 15: Hoare triple {3122#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3122#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:37,560 INFO L280 TraceCheckUtils]: 16: Hoare triple {3122#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3123#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2020-07-10 15:28:37,560 INFO L280 TraceCheckUtils]: 17: Hoare triple {3123#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume 0 == ~__VERIFIER_assert__cond~9; {3118#false} is VALID [2020-07-10 15:28:37,561 INFO L280 TraceCheckUtils]: 18: Hoare triple {3118#false} assume !false; {3118#false} is VALID [2020-07-10 15:28:37,561 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 15:28:37,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962490234] [2020-07-10 15:28:37,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:37,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:37,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248135785] [2020-07-10 15:28:37,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 15:28:37,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:37,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:37,588 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 15:28:37,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:37,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:37,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:37,589 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2020-07-10 15:28:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,915 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-07-10 15:28:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:37,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 15:28:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-10 15:28:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-10 15:28:37,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-10 15:28:38,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:38,021 INFO L225 Difference]: With dead ends: 61 [2020-07-10 15:28:38,022 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 15:28:38,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 15:28:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-07-10 15:28:38,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:38,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 42 states. [2020-07-10 15:28:38,059 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 42 states. [2020-07-10 15:28:38,060 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 42 states. [2020-07-10 15:28:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,062 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-10 15:28:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-10 15:28:38,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:38,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:38,062 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 59 states. [2020-07-10 15:28:38,062 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 59 states. [2020-07-10 15:28:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,064 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-10 15:28:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-10 15:28:38,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:38,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:38,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:38,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:28:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-07-10 15:28:38,065 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2020-07-10 15:28:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:38,065 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-07-10 15:28:38,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-10 15:28:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:28:38,066 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:38,066 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] [2020-07-10 15:28:38,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:28:38,066 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1401802644, now seen corresponding path program 1 times [2020-07-10 15:28:38,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:38,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867793728] [2020-07-10 15:28:38,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:38,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {3380#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3373#true} is VALID [2020-07-10 15:28:38,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {3373#true} assume true; {3373#true} is VALID [2020-07-10 15:28:38,154 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3373#true} {3373#true} #147#return; {3373#true} is VALID [2020-07-10 15:28:38,156 INFO L263 TraceCheckUtils]: 0: Hoare triple {3373#true} call ULTIMATE.init(); {3380#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:38,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {3380#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3373#true} is VALID [2020-07-10 15:28:38,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {3373#true} assume true; {3373#true} is VALID [2020-07-10 15:28:38,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3373#true} {3373#true} #147#return; {3373#true} is VALID [2020-07-10 15:28:38,156 INFO L263 TraceCheckUtils]: 4: Hoare triple {3373#true} call #t~ret3 := main(); {3373#true} is VALID [2020-07-10 15:28:38,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {3373#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {3373#true} is VALID [2020-07-10 15:28:38,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {3373#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3373#true} is VALID [2020-07-10 15:28:38,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {3373#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3373#true} is VALID [2020-07-10 15:28:38,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {3373#true} assume ~main__i~0 < ~main__len~0; {3373#true} is VALID [2020-07-10 15:28:38,157 INFO L280 TraceCheckUtils]: 9: Hoare triple {3373#true} assume ~main__j~0 < ~main__limit~0; {3373#true} is VALID [2020-07-10 15:28:38,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {3373#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2020-07-10 15:28:38,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2020-07-10 15:28:38,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2020-07-10 15:28:38,165 INFO L280 TraceCheckUtils]: 13: Hoare triple {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2020-07-10 15:28:38,166 INFO L280 TraceCheckUtils]: 14: Hoare triple {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2020-07-10 15:28:38,166 INFO L280 TraceCheckUtils]: 15: Hoare triple {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2020-07-10 15:28:38,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} is VALID [2020-07-10 15:28:38,168 INFO L280 TraceCheckUtils]: 17: Hoare triple {3378#(<= (+ main_~main__i~0 2) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3379#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2020-07-10 15:28:38,169 INFO L280 TraceCheckUtils]: 18: Hoare triple {3379#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {3374#false} is VALID [2020-07-10 15:28:38,169 INFO L280 TraceCheckUtils]: 19: Hoare triple {3374#false} assume !false; {3374#false} is VALID [2020-07-10 15:28:38,170 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 15:28:38,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867793728] [2020-07-10 15:28:38,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:38,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:38,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705969337] [2020-07-10 15:28:38,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 15:28:38,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:38,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:38,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:38,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:38,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:38,203 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-07-10 15:28:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,684 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-10 15:28:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:38,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 15:28:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-10 15:28:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-10 15:28:38,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2020-07-10 15:28:38,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:38,805 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:28:38,805 INFO L226 Difference]: Without dead ends: 67 [2020-07-10 15:28:38,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-10 15:28:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2020-07-10 15:28:38,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:38,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 40 states. [2020-07-10 15:28:38,864 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 40 states. [2020-07-10 15:28:38,864 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 40 states. [2020-07-10 15:28:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,865 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:28:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:28:38,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:38,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:38,868 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 67 states. [2020-07-10 15:28:38,869 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 67 states. [2020-07-10 15:28:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,871 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:28:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:28:38,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:38,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:38,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:38,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:28:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-10 15:28:38,874 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2020-07-10 15:28:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:38,874 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-10 15:28:38,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:28:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:28:38,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:38,875 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] [2020-07-10 15:28:38,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:28:38,876 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash 506212151, now seen corresponding path program 1 times [2020-07-10 15:28:38,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:38,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787642856] [2020-07-10 15:28:38,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:38,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {3663#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3655#true} is VALID [2020-07-10 15:28:38,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {3655#true} assume true; {3655#true} is VALID [2020-07-10 15:28:38,960 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3655#true} {3655#true} #147#return; {3655#true} is VALID [2020-07-10 15:28:38,961 INFO L263 TraceCheckUtils]: 0: Hoare triple {3655#true} call ULTIMATE.init(); {3663#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:38,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {3663#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3655#true} is VALID [2020-07-10 15:28:38,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2020-07-10 15:28:38,962 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #147#return; {3655#true} is VALID [2020-07-10 15:28:38,963 INFO L263 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret3 := main(); {3655#true} is VALID [2020-07-10 15:28:38,963 INFO L280 TraceCheckUtils]: 5: Hoare triple {3655#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {3655#true} is VALID [2020-07-10 15:28:38,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {3655#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,966 INFO L280 TraceCheckUtils]: 7: Hoare triple {3660#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,967 INFO L280 TraceCheckUtils]: 8: Hoare triple {3660#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,968 INFO L280 TraceCheckUtils]: 9: Hoare triple {3660#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,969 INFO L280 TraceCheckUtils]: 10: Hoare triple {3660#(<= 0 main_~main__i~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,970 INFO L280 TraceCheckUtils]: 11: Hoare triple {3660#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,971 INFO L280 TraceCheckUtils]: 12: Hoare triple {3660#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,971 INFO L280 TraceCheckUtils]: 13: Hoare triple {3660#(<= 0 main_~main__i~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,972 INFO L280 TraceCheckUtils]: 14: Hoare triple {3660#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,972 INFO L280 TraceCheckUtils]: 15: Hoare triple {3660#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,973 INFO L280 TraceCheckUtils]: 16: Hoare triple {3660#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3660#(<= 0 main_~main__i~0)} is VALID [2020-07-10 15:28:38,975 INFO L280 TraceCheckUtils]: 17: Hoare triple {3660#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3661#(<= 1 main_~main__i~0)} is VALID [2020-07-10 15:28:38,976 INFO L280 TraceCheckUtils]: 18: Hoare triple {3661#(<= 1 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {3662#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2020-07-10 15:28:38,977 INFO L280 TraceCheckUtils]: 19: Hoare triple {3662#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {3656#false} is VALID [2020-07-10 15:28:38,977 INFO L280 TraceCheckUtils]: 20: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2020-07-10 15:28:38,978 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 15:28:38,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787642856] [2020-07-10 15:28:38,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:38,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:38,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920074086] [2020-07-10 15:28:38,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 15:28:38,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:38,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:39,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:39,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:39,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:39,007 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2020-07-10 15:28:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,657 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-07-10 15:28:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:39,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 15:28:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-10 15:28:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-10 15:28:39,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2020-07-10 15:28:39,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:39,799 INFO L225 Difference]: With dead ends: 74 [2020-07-10 15:28:39,799 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 15:28:39,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 15:28:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2020-07-10 15:28:39,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:39,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 38 states. [2020-07-10 15:28:39,879 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 38 states. [2020-07-10 15:28:39,879 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 38 states. [2020-07-10 15:28:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,881 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-10 15:28:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-10 15:28:39,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:39,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:39,882 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 72 states. [2020-07-10 15:28:39,883 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 72 states. [2020-07-10 15:28:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,885 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-10 15:28:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-10 15:28:39,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:39,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:39,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:39,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 15:28:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-07-10 15:28:39,888 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2020-07-10 15:28:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:39,888 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-07-10 15:28:39,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:28:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:28:39,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:39,889 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] [2020-07-10 15:28:39,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:28:39,890 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1487289350, now seen corresponding path program 1 times [2020-07-10 15:28:39,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:39,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533128059] [2020-07-10 15:28:39,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:40,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {3960#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3951#true} is VALID [2020-07-10 15:28:40,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {3951#true} assume true; {3951#true} is VALID [2020-07-10 15:28:40,008 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3951#true} {3951#true} #147#return; {3951#true} is VALID [2020-07-10 15:28:40,009 INFO L263 TraceCheckUtils]: 0: Hoare triple {3951#true} call ULTIMATE.init(); {3960#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:40,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {3960#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {3951#true} is VALID [2020-07-10 15:28:40,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {3951#true} assume true; {3951#true} is VALID [2020-07-10 15:28:40,010 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3951#true} {3951#true} #147#return; {3951#true} is VALID [2020-07-10 15:28:40,010 INFO L263 TraceCheckUtils]: 4: Hoare triple {3951#true} call #t~ret3 := main(); {3951#true} is VALID [2020-07-10 15:28:40,011 INFO L280 TraceCheckUtils]: 5: Hoare triple {3951#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {3951#true} is VALID [2020-07-10 15:28:40,012 INFO L280 TraceCheckUtils]: 6: Hoare triple {3951#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,012 INFO L280 TraceCheckUtils]: 7: Hoare triple {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,013 INFO L280 TraceCheckUtils]: 8: Hoare triple {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,015 INFO L280 TraceCheckUtils]: 9: Hoare triple {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,016 INFO L280 TraceCheckUtils]: 10: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,017 INFO L280 TraceCheckUtils]: 11: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,024 INFO L280 TraceCheckUtils]: 17: Hoare triple {3957#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {3958#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,025 INFO L280 TraceCheckUtils]: 18: Hoare triple {3958#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {3958#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:40,027 INFO L280 TraceCheckUtils]: 19: Hoare triple {3958#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {3959#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2020-07-10 15:28:40,028 INFO L280 TraceCheckUtils]: 20: Hoare triple {3959#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {3952#false} is VALID [2020-07-10 15:28:40,028 INFO L280 TraceCheckUtils]: 21: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2020-07-10 15:28:40,029 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 15:28:40,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533128059] [2020-07-10 15:28:40,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:40,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:40,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988270402] [2020-07-10 15:28:40,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:28:40,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:40,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:40,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:40,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:40,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:40,067 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2020-07-10 15:28:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:40,833 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-07-10 15:28:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:28:40,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:28:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-10 15:28:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-10 15:28:40,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2020-07-10 15:28:40,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:40,967 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:28:40,968 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:28:40,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:28:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:28:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2020-07-10 15:28:41,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:41,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 36 states. [2020-07-10 15:28:41,040 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 36 states. [2020-07-10 15:28:41,040 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 36 states. [2020-07-10 15:28:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:41,042 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-10 15:28:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-07-10 15:28:41,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:41,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:41,043 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 60 states. [2020-07-10 15:28:41,043 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 60 states. [2020-07-10 15:28:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:41,045 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-10 15:28:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-07-10 15:28:41,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:41,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:41,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:41,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:28:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-07-10 15:28:41,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2020-07-10 15:28:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:41,048 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-07-10 15:28:41,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:28:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:28:41,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:41,052 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] [2020-07-10 15:28:41,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:28:41,054 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1138673565, now seen corresponding path program 1 times [2020-07-10 15:28:41,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:41,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695108324] [2020-07-10 15:28:41,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:41,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {4224#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {4216#true} is VALID [2020-07-10 15:28:41,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {4216#true} assume true; {4216#true} is VALID [2020-07-10 15:28:41,212 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4216#true} {4216#true} #147#return; {4216#true} is VALID [2020-07-10 15:28:41,213 INFO L263 TraceCheckUtils]: 0: Hoare triple {4216#true} call ULTIMATE.init(); {4224#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:41,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {4224#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {4216#true} is VALID [2020-07-10 15:28:41,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {4216#true} assume true; {4216#true} is VALID [2020-07-10 15:28:41,214 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4216#true} {4216#true} #147#return; {4216#true} is VALID [2020-07-10 15:28:41,214 INFO L263 TraceCheckUtils]: 4: Hoare triple {4216#true} call #t~ret3 := main(); {4216#true} is VALID [2020-07-10 15:28:41,215 INFO L280 TraceCheckUtils]: 5: Hoare triple {4216#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {4216#true} is VALID [2020-07-10 15:28:41,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {4216#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4216#true} is VALID [2020-07-10 15:28:41,217 INFO L280 TraceCheckUtils]: 7: Hoare triple {4216#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,219 INFO L280 TraceCheckUtils]: 8: Hoare triple {4221#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {4221#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,221 INFO L280 TraceCheckUtils]: 10: Hoare triple {4221#(<= 0 main_~main__j~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,221 INFO L280 TraceCheckUtils]: 11: Hoare triple {4221#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,223 INFO L280 TraceCheckUtils]: 12: Hoare triple {4221#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,224 INFO L280 TraceCheckUtils]: 13: Hoare triple {4221#(<= 0 main_~main__j~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,225 INFO L280 TraceCheckUtils]: 14: Hoare triple {4221#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,225 INFO L280 TraceCheckUtils]: 15: Hoare triple {4221#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,226 INFO L280 TraceCheckUtils]: 16: Hoare triple {4221#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4221#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:41,228 INFO L280 TraceCheckUtils]: 17: Hoare triple {4221#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4222#(<= 1 main_~main__j~0)} is VALID [2020-07-10 15:28:41,228 INFO L280 TraceCheckUtils]: 18: Hoare triple {4222#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4222#(<= 1 main_~main__j~0)} is VALID [2020-07-10 15:28:41,229 INFO L280 TraceCheckUtils]: 19: Hoare triple {4222#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4222#(<= 1 main_~main__j~0)} is VALID [2020-07-10 15:28:41,230 INFO L280 TraceCheckUtils]: 20: Hoare triple {4222#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4223#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2020-07-10 15:28:41,231 INFO L280 TraceCheckUtils]: 21: Hoare triple {4223#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {4217#false} is VALID [2020-07-10 15:28:41,232 INFO L280 TraceCheckUtils]: 22: Hoare triple {4217#false} assume !false; {4217#false} is VALID [2020-07-10 15:28:41,233 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 15:28:41,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695108324] [2020-07-10 15:28:41,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:41,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:41,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934795882] [2020-07-10 15:28:41,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 15:28:41,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:41,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:41,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:41,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:41,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:41,270 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2020-07-10 15:28:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:41,995 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-07-10 15:28:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:41,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 15:28:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-10 15:28:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-10 15:28:42,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2020-07-10 15:28:42,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:42,178 INFO L225 Difference]: With dead ends: 87 [2020-07-10 15:28:42,178 INFO L226 Difference]: Without dead ends: 85 [2020-07-10 15:28:42,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-10 15:28:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2020-07-10 15:28:42,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:42,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 34 states. [2020-07-10 15:28:42,242 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 34 states. [2020-07-10 15:28:42,243 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 34 states. [2020-07-10 15:28:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:42,245 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2020-07-10 15:28:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-10 15:28:42,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:42,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:42,247 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 85 states. [2020-07-10 15:28:42,247 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 85 states. [2020-07-10 15:28:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:42,251 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2020-07-10 15:28:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-10 15:28:42,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:42,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:42,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:42,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:28:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-10 15:28:42,255 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2020-07-10 15:28:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:42,256 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-10 15:28:42,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-10 15:28:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:28:42,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:42,259 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 15:28:42,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:28:42,260 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 939145312, now seen corresponding path program 1 times [2020-07-10 15:28:42,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:42,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523269830] [2020-07-10 15:28:42,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:42,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {4560#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {4551#true} is VALID [2020-07-10 15:28:42,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {4551#true} assume true; {4551#true} is VALID [2020-07-10 15:28:42,412 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4551#true} {4551#true} #147#return; {4551#true} is VALID [2020-07-10 15:28:42,414 INFO L263 TraceCheckUtils]: 0: Hoare triple {4551#true} call ULTIMATE.init(); {4560#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:42,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {4560#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {4551#true} is VALID [2020-07-10 15:28:42,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {4551#true} assume true; {4551#true} is VALID [2020-07-10 15:28:42,415 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4551#true} {4551#true} #147#return; {4551#true} is VALID [2020-07-10 15:28:42,416 INFO L263 TraceCheckUtils]: 4: Hoare triple {4551#true} call #t~ret3 := main(); {4551#true} is VALID [2020-07-10 15:28:42,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {4551#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {4551#true} is VALID [2020-07-10 15:28:42,418 INFO L280 TraceCheckUtils]: 6: Hoare triple {4551#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,419 INFO L280 TraceCheckUtils]: 7: Hoare triple {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,421 INFO L280 TraceCheckUtils]: 9: Hoare triple {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,422 INFO L280 TraceCheckUtils]: 10: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,423 INFO L280 TraceCheckUtils]: 11: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,425 INFO L280 TraceCheckUtils]: 13: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,425 INFO L280 TraceCheckUtils]: 14: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,426 INFO L280 TraceCheckUtils]: 15: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,430 INFO L280 TraceCheckUtils]: 16: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,433 INFO L280 TraceCheckUtils]: 17: Hoare triple {4557#(<= (+ main_~main__j~0 5) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,434 INFO L280 TraceCheckUtils]: 18: Hoare triple {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,436 INFO L280 TraceCheckUtils]: 19: Hoare triple {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,437 INFO L280 TraceCheckUtils]: 20: Hoare triple {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} is VALID [2020-07-10 15:28:42,438 INFO L280 TraceCheckUtils]: 21: Hoare triple {4558#(<= (+ main_~main__j~0 4) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {4559#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2020-07-10 15:28:42,439 INFO L280 TraceCheckUtils]: 22: Hoare triple {4559#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {4552#false} is VALID [2020-07-10 15:28:42,439 INFO L280 TraceCheckUtils]: 23: Hoare triple {4552#false} assume !false; {4552#false} is VALID [2020-07-10 15:28:42,441 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 15:28:42,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523269830] [2020-07-10 15:28:42,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:42,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:42,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011821432] [2020-07-10 15:28:42,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:28:42,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:42,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:42,475 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 15:28:42,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:42,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:42,477 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2020-07-10 15:28:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:43,160 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-10 15:28:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:28:43,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:28:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-10 15:28:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-10 15:28:43,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-10 15:28:43,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:43,280 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:28:43,280 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 15:28:43,281 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:28:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 15:28:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2020-07-10 15:28:43,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:43,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 32 states. [2020-07-10 15:28:43,359 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 32 states. [2020-07-10 15:28:43,359 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 32 states. [2020-07-10 15:28:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:43,361 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-07-10 15:28:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-10 15:28:43,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:43,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:43,362 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 58 states. [2020-07-10 15:28:43,363 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 58 states. [2020-07-10 15:28:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:43,366 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-07-10 15:28:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-10 15:28:43,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:43,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:43,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:43,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:28:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 15:28:43,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2020-07-10 15:28:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:43,369 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 15:28:43,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:28:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:28:43,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:43,372 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] [2020-07-10 15:28:43,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:28:43,374 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash -951263229, now seen corresponding path program 1 times [2020-07-10 15:28:43,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:43,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537221298] [2020-07-10 15:28:43,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:43,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {4815#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {4806#true} is VALID [2020-07-10 15:28:43,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {4806#true} assume true; {4806#true} is VALID [2020-07-10 15:28:43,566 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4806#true} {4806#true} #147#return; {4806#true} is VALID [2020-07-10 15:28:43,570 INFO L263 TraceCheckUtils]: 0: Hoare triple {4806#true} call ULTIMATE.init(); {4815#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} is VALID [2020-07-10 15:28:43,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {4815#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|))} ~__return_main~0 := 0;~__return_334~0 := 0; {4806#true} is VALID [2020-07-10 15:28:43,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2020-07-10 15:28:43,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #147#return; {4806#true} is VALID [2020-07-10 15:28:43,572 INFO L263 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret3 := main(); {4806#true} is VALID [2020-07-10 15:28:43,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {4806#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__bufsize~0 := #t~nondet0;havoc #t~nondet0; {4806#true} is VALID [2020-07-10 15:28:43,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {4806#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__len~0 := #t~nondet1;havoc #t~nondet1;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4806#true} is VALID [2020-07-10 15:28:43,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {4806#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {4811#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {4811#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {4811#(<= 0 main_~main__j~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,576 INFO L280 TraceCheckUtils]: 11: Hoare triple {4811#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,577 INFO L280 TraceCheckUtils]: 12: Hoare triple {4811#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,578 INFO L280 TraceCheckUtils]: 13: Hoare triple {4811#(<= 0 main_~main__j~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,578 INFO L280 TraceCheckUtils]: 14: Hoare triple {4811#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,579 INFO L280 TraceCheckUtils]: 15: Hoare triple {4811#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,580 INFO L280 TraceCheckUtils]: 16: Hoare triple {4811#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4811#(<= 0 main_~main__j~0)} is VALID [2020-07-10 15:28:43,581 INFO L280 TraceCheckUtils]: 17: Hoare triple {4811#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4812#(<= 1 main_~main__j~0)} is VALID [2020-07-10 15:28:43,582 INFO L280 TraceCheckUtils]: 18: Hoare triple {4812#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4812#(<= 1 main_~main__j~0)} is VALID [2020-07-10 15:28:43,583 INFO L280 TraceCheckUtils]: 19: Hoare triple {4812#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4812#(<= 1 main_~main__j~0)} is VALID [2020-07-10 15:28:43,584 INFO L280 TraceCheckUtils]: 20: Hoare triple {4812#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4812#(<= 1 main_~main__j~0)} is VALID [2020-07-10 15:28:43,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {4812#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {4813#(<= 2 main_~main__j~0)} is VALID [2020-07-10 15:28:43,586 INFO L280 TraceCheckUtils]: 22: Hoare triple {4813#(<= 2 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {4814#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2020-07-10 15:28:43,587 INFO L280 TraceCheckUtils]: 23: Hoare triple {4814#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {4807#false} is VALID [2020-07-10 15:28:43,587 INFO L280 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2020-07-10 15:28:43,589 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 15:28:43,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537221298] [2020-07-10 15:28:43,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:43,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:43,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427028333] [2020-07-10 15:28:43,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-10 15:28:43,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:43,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:43,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:43,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:43,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:43,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:43,628 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2020-07-10 15:28:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:44,664 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2020-07-10 15:28:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:28:44,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-10 15:28:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2020-07-10 15:28:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2020-07-10 15:28:44,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2020-07-10 15:28:44,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:44,879 INFO L225 Difference]: With dead ends: 125 [2020-07-10 15:28:44,879 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:44,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:28:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:44,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:44,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:44,882 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:44,882 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:44,882 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:44,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:44,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:44,883 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:44,883 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:44,883 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:44,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:44,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:44,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:44,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:44,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-10 15:28:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:44,884 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:44,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:44,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:44,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 15:28:44,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:45,205 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 92 [2020-07-10 15:28:45,454 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 72 [2020-07-10 15:28:45,709 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 48 [2020-07-10 15:28:46,023 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 39 [2020-07-10 15:28:46,243 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 23 [2020-07-10 15:28:46,352 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:46,353 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|)) [2020-07-10 15:28:46,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:46,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:46,354 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:46,354 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:46,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:46,355 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:46,355 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:28:46,355 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:46,355 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:46,355 INFO L268 CegarLoopResult]: For program point L225(lines 225 267) no Hoare annotation was computed. [2020-07-10 15:28:46,356 INFO L268 CegarLoopResult]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 86) no Hoare annotation was computed. [2020-07-10 15:28:46,356 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 311) no Hoare annotation was computed. [2020-07-10 15:28:46,356 INFO L268 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2020-07-10 15:28:46,357 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-07-10 15:28:46,357 INFO L268 CegarLoopResult]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2020-07-10 15:28:46,357 INFO L268 CegarLoopResult]: For program point L201(lines 201 271) no Hoare annotation was computed. [2020-07-10 15:28:46,357 INFO L268 CegarLoopResult]: For program point L36(lines 36 292) no Hoare annotation was computed. [2020-07-10 15:28:46,357 INFO L268 CegarLoopResult]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2020-07-10 15:28:46,358 INFO L268 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-07-10 15:28:46,358 INFO L268 CegarLoopResult]: For program point L243(line 243) no Hoare annotation was computed. [2020-07-10 15:28:46,358 INFO L268 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2020-07-10 15:28:46,358 INFO L268 CegarLoopResult]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2020-07-10 15:28:46,359 INFO L268 CegarLoopResult]: For program point L227(line 227) no Hoare annotation was computed. [2020-07-10 15:28:46,359 INFO L268 CegarLoopResult]: For program point L161(lines 161 277) no Hoare annotation was computed. [2020-07-10 15:28:46,359 INFO L268 CegarLoopResult]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2020-07-10 15:28:46,360 INFO L264 CegarLoopResult]: At program point L302(lines 23 310) the Hoare annotation is: (and (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__i~0)) [2020-07-10 15:28:46,360 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 311) no Hoare annotation was computed. [2020-07-10 15:28:46,361 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-10 15:28:46,362 INFO L268 CegarLoopResult]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2020-07-10 15:28:46,362 INFO L268 CegarLoopResult]: For program point L137(lines 137 281) no Hoare annotation was computed. [2020-07-10 15:28:46,362 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2020-07-10 15:28:46,362 INFO L268 CegarLoopResult]: For program point L96(lines 96 123) no Hoare annotation was computed. [2020-07-10 15:28:46,362 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 311) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2020-07-10 15:28:46,362 INFO L268 CegarLoopResult]: For program point L253(lines 253 263) no Hoare annotation was computed. [2020-07-10 15:28:46,363 INFO L268 CegarLoopResult]: For program point L55(lines 55 284) no Hoare annotation was computed. [2020-07-10 15:28:46,363 INFO L268 CegarLoopResult]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2020-07-10 15:28:46,363 INFO L268 CegarLoopResult]: For program point L72(lines 72 127) no Hoare annotation was computed. [2020-07-10 15:28:46,365 INFO L264 CegarLoopResult]: At program point L262(lines 29 304) the Hoare annotation is: (let ((.cse0 (= |old(~__return_334~0)| ~__return_334~0)) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (or (and (<= (+ main_~main__i~0 1) main_~main__len~0) .cse0 (<= 0 main_~main__j~0) .cse1 (<= 0 main_~main__i~0)) (and .cse0 (let ((.cse4 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse2 (let ((.cse5 (<= 1 main_~main__i~0))) (or (and .cse1 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse5) (and .cse1 .cse4 .cse5)))) (.cse3 (<= 1 main_~main__j~0))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~14 0)) .cse3) (and .cse2 .cse4 .cse3))))))) [2020-07-10 15:28:46,365 INFO L268 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2020-07-10 15:28:46,366 INFO L268 CegarLoopResult]: For program point L64(lines 64 283) no Hoare annotation was computed. [2020-07-10 15:28:46,366 INFO L268 CegarLoopResult]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2020-07-10 15:28:46,366 INFO L268 CegarLoopResult]: For program point L213(lines 213 269) no Hoare annotation was computed. [2020-07-10 15:28:46,367 INFO L268 CegarLoopResult]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2020-07-10 15:28:46,367 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-07-10 15:28:46,368 INFO L268 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-07-10 15:28:46,368 INFO L268 CegarLoopResult]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2020-07-10 15:28:46,368 INFO L268 CegarLoopResult]: For program point L255(line 255) no Hoare annotation was computed. [2020-07-10 15:28:46,368 INFO L268 CegarLoopResult]: For program point L189(lines 189 273) no Hoare annotation was computed. [2020-07-10 15:28:46,368 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-10 15:28:46,369 INFO L268 CegarLoopResult]: For program point L173(lines 173 275) no Hoare annotation was computed. [2020-07-10 15:28:46,369 INFO L268 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-07-10 15:28:46,369 INFO L268 CegarLoopResult]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2020-07-10 15:28:46,369 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 57) no Hoare annotation was computed. [2020-07-10 15:28:46,369 INFO L268 CegarLoopResult]: For program point L215(line 215) no Hoare annotation was computed. [2020-07-10 15:28:46,369 INFO L268 CegarLoopResult]: For program point L149(lines 149 279) no Hoare annotation was computed. [2020-07-10 15:28:46,370 INFO L268 CegarLoopResult]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-07-10 15:28:46,370 INFO L268 CegarLoopResult]: For program point L108(lines 108 121) no Hoare annotation was computed. [2020-07-10 15:28:46,370 INFO L268 CegarLoopResult]: For program point L34(lines 34 298) no Hoare annotation was computed. [2020-07-10 15:28:46,370 INFO L268 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-07-10 15:28:46,370 INFO L268 CegarLoopResult]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2020-07-10 15:28:46,370 INFO L268 CegarLoopResult]: For program point L84(lines 84 125) no Hoare annotation was computed. [2020-07-10 15:28:46,371 INFO L268 CegarLoopResult]: For program point L18(lines 18 310) no Hoare annotation was computed. [2020-07-10 15:28:46,371 INFO L268 CegarLoopResult]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2020-07-10 15:28:46,371 INFO L268 CegarLoopResult]: For program point L241(lines 241 265) no Hoare annotation was computed. [2020-07-10 15:28:46,371 INFO L268 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2020-07-10 15:28:46,371 INFO L268 CegarLoopResult]: For program point L43(lines 43 286) no Hoare annotation was computed. [2020-07-10 15:28:46,371 INFO L264 CegarLoopResult]: At program point L291(lines 36 292) the Hoare annotation is: (and (<= (+ main_~main__i~0 1) main_~main__len~0) (= |old(~__return_334~0)| ~__return_334~0) (<= 0 main_~main__j~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0)) [2020-07-10 15:28:46,378 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:46,379 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:28:46,379 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:28:46,380 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:46,380 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:46,380 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:46,381 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:46,381 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:28:46,381 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:28:46,381 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:46,381 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:46,381 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:28:46,381 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:46,383 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:46,383 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:46,384 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 15:28:46,385 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 15:28:46,385 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:28:46,386 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 15:28:46,387 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-10 15:28:46,388 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-10 15:28:46,389 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-10 15:28:46,389 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-10 15:28:46,389 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-10 15:28:46,389 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-10 15:28:46,389 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-10 15:28:46,390 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-10 15:28:46,390 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-10 15:28:46,391 WARN L170 areAnnotationChecker]: L163 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L163 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-10 15:28:46,392 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2020-07-10 15:28:46,393 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L227 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L227 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2020-07-10 15:28:46,394 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2020-07-10 15:28:46,395 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-10 15:28:46,395 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-10 15:28:46,395 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2020-07-10 15:28:46,395 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2020-07-10 15:28:46,395 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:46,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:46 BoogieIcfgContainer [2020-07-10 15:28:46,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:46,433 INFO L168 Benchmark]: Toolchain (without parser) took 19233.70 ms. Allocated memory was 136.3 MB in the beginning and 390.1 MB in the end (delta: 253.8 MB). Free memory was 101.4 MB in the beginning and 170.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 185.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:46,437 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:46,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.96 ms. Allocated memory is still 136.3 MB. Free memory was 101.2 MB in the beginning and 88.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:46,441 INFO L168 Benchmark]: Boogie Preprocessor took 181.43 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 88.1 MB in the beginning and 178.8 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:46,442 INFO L168 Benchmark]: RCFGBuilder took 817.84 ms. Allocated memory is still 200.8 MB. Free memory was 178.1 MB in the beginning and 143.4 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:46,446 INFO L168 Benchmark]: TraceAbstraction took 17794.63 ms. Allocated memory was 200.8 MB in the beginning and 390.1 MB in the end (delta: 189.3 MB). Free memory was 142.7 MB in the beginning and 170.0 MB in the end (delta: -27.3 MB). Peak memory consumption was 162.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:46,448 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.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 430.96 ms. Allocated memory is still 136.3 MB. Free memory was 101.2 MB in the beginning and 88.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 181.43 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 88.1 MB in the beginning and 178.8 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.84 ms. Allocated memory is still 200.8 MB. Free memory was 178.1 MB in the beginning and 143.4 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17794.63 ms. Allocated memory was 200.8 MB in the beginning and 390.1 MB in the end (delta: 189.3 MB). Free memory was 142.7 MB in the beginning and 170.0 MB in the end (delta: -27.3 MB). Peak memory consumption was 162.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 255]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 151]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 163]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 227]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 191]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 243]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 215]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 98]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 86]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 57]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((main__i + 1 <= main__len && \old(__return_334) == __return_334) && 0 <= main__j) && main__limit + 4 <= main__bufsize) && 0 <= main__i) || (\old(__return_334) == __return_334 && ((((((main__limit + 4 <= main__bufsize && !(__VERIFIER_assert__cond == 0)) && 1 <= main__i) || ((main__limit + 4 <= main__bufsize && main__j + 4 <= main__bufsize) && 1 <= main__i)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__j) || (((((main__limit + 4 <= main__bufsize && !(__VERIFIER_assert__cond == 0)) && 1 <= main__i) || ((main__limit + 4 <= main__bufsize && main__j + 4 <= main__bufsize) && 1 <= main__i)) && main__j + 4 <= main__bufsize) && 1 <= main__j))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((main__i + 1 <= main__len && \old(__return_334) == __return_334) && 0 <= main__j) && main__limit + 4 <= main__bufsize) && 0 <= main__i) && main__j + 5 <= main__bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (\old(__return_334) == __return_334 && main__limit + 4 <= main__bufsize) && 0 <= main__i - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 69 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 935 SDtfs, 1910 SDslu, 227 SDs, 0 SdLazy, 1420 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 148 HoareAnnotationTreeSize, 7 FomulaSimplifications, 909827071 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 37836 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 15056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...