/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-267fbe0 [2020-07-17 22:51:11,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:11,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:11,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:11,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:11,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:11,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:11,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:11,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:11,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:11,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:11,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:11,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:11,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:11,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:11,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:11,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:11,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:11,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:11,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:11,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:11,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:11,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:11,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:11,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:11,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:11,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:11,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:11,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:11,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:11,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:11,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:11,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:11,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:11,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:11,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:11,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:11,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:11,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:11,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:11,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:11,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:11,892 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:11,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:11,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:11,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:11,894 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:11,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:11,894 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:11,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:11,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:11,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:11,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:11,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:11,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:11,896 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:11,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:11,896 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:11,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:11,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:11,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:11,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:11,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:11,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:11,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:11,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:11,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:11,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:11,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:11,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:11,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:11,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:12,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:12,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:12,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:12,258 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:12,258 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:12,259 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-17 22:51:12,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308fcfb2c/ed0c0fa0ede84a59a54ad0709af7308f/FLAG6f6915a06 [2020-07-17 22:51:12,979 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:12,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-07-17 22:51:12,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308fcfb2c/ed0c0fa0ede84a59a54ad0709af7308f/FLAG6f6915a06 [2020-07-17 22:51:13,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308fcfb2c/ed0c0fa0ede84a59a54ad0709af7308f [2020-07-17 22:51:13,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:13,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:13,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:13,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:13,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:13,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a645166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13, skipping insertion in model container [2020-07-17 22:51:13,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:13,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:13,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:13,714 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:13,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:13,821 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:13,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13 WrapperNode [2020-07-17 22:51:13,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:13,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:13,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:13,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:13,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... [2020-07-17 22:51:13,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:13,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:13,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:13,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:13,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:14,689 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:14,690 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:51:14,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:14 BoogieIcfgContainer [2020-07-17 22:51:14,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:14,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:14,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:14,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:14,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:13" (1/3) ... [2020-07-17 22:51:14,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3debab87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:14, skipping insertion in model container [2020-07-17 22:51:14,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:13" (2/3) ... [2020-07-17 22:51:14,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3debab87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:14, skipping insertion in model container [2020-07-17 22:51:14,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:14" (3/3) ... [2020-07-17 22:51:14,707 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2020-07-17 22:51:14,717 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:14,726 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-17 22:51:14,743 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-17 22:51:14,767 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:14,767 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:14,768 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:14,768 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:14,768 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:14,768 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:14,768 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:14,769 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-17 22:51:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:51:14,804 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:14,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:14,806 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-17 22:51:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1781845407, now seen corresponding path program 1 times [2020-07-17 22:51:14,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:14,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85533242] [2020-07-17 22:51:14,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,111 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-17 22:51:15,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-17 22:51:15,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} #147#return; {68#true} is VALID [2020-07-17 22:51:15,117 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-17 22:51:15,118 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-17 22:51:15,119 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-17 22:51:15,119 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #147#return; {68#true} is VALID [2020-07-17 22:51:15,119 INFO L263 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret3 := main(); {68#true} is VALID [2020-07-17 22:51:15,120 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-17 22:51:15,121 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-17 22:51:15,121 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-17 22:51:15,122 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2020-07-17 22:51:15,122 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2020-07-17 22:51:15,124 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-17 22:51:15,125 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-17 22:51:15,126 INFO L280 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-17 22:51:15,128 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-17 22:51:15,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85533242] [2020-07-17 22:51:15,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:15,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:51:15,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972194142] [2020-07-17 22:51:15,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-17 22:51:15,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:15,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:51:15,185 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-17 22:51:15,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:51:15,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:15,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:51:15,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:51:15,203 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2020-07-17 22:51:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:15,706 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2020-07-17 22:51:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:15,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-17 22:51:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:51:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2020-07-17 22:51:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:51:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2020-07-17 22:51:15,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2020-07-17 22:51:15,970 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-17 22:51:15,991 INFO L225 Difference]: With dead ends: 90 [2020-07-17 22:51:15,991 INFO L226 Difference]: Without dead ends: 76 [2020-07-17 22:51:15,996 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-17 22:51:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-17 22:51:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2020-07-17 22:51:16,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:16,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 59 states. [2020-07-17 22:51:16,081 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 59 states. [2020-07-17 22:51:16,082 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 59 states. [2020-07-17 22:51:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,092 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-07-17 22:51:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-07-17 22:51:16,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,095 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 76 states. [2020-07-17 22:51:16,095 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 76 states. [2020-07-17 22:51:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,103 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-07-17 22:51:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-07-17 22:51:16,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:16,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-17 22:51:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-07-17 22:51:16,114 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2020-07-17 22:51:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:16,114 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-17 22:51:16,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:51:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-17 22:51:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:51:16,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:16,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:16,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:16,118 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-17 22:51:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash -594195383, now seen corresponding path program 1 times [2020-07-17 22:51:16,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:16,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307598367] [2020-07-17 22:51:16,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,247 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-17 22:51:16,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {398#true} assume true; {398#true} is VALID [2020-07-17 22:51:16,248 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} #147#return; {398#true} is VALID [2020-07-17 22:51:16,249 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-17 22:51:16,250 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-17 22:51:16,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2020-07-17 22:51:16,251 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #147#return; {398#true} is VALID [2020-07-17 22:51:16,251 INFO L263 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret3 := main(); {398#true} is VALID [2020-07-17 22:51:16,252 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-17 22:51:16,252 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-17 22:51:16,253 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-17 22:51:16,254 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-17 22:51:16,256 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-17 22:51:16,257 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-17 22:51:16,258 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-17 22:51:16,259 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-17 22:51:16,260 INFO L280 TraceCheckUtils]: 13: Hoare triple {399#false} assume !false; {399#false} is VALID [2020-07-17 22:51:16,262 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-17 22:51:16,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307598367] [2020-07-17 22:51:16,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:16,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:16,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172870574] [2020-07-17 22:51:16,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:51:16,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:16,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:16,291 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-17 22:51:16,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:16,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:16,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:16,293 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2020-07-17 22:51:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,046 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2020-07-17 22:51:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:17,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:51:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-17 22:51:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-17 22:51:17,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2020-07-17 22:51:17,355 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-17 22:51:17,359 INFO L225 Difference]: With dead ends: 153 [2020-07-17 22:51:17,360 INFO L226 Difference]: Without dead ends: 101 [2020-07-17 22:51:17,363 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-17 22:51:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-17 22:51:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2020-07-17 22:51:17,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:17,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 58 states. [2020-07-17 22:51:17,408 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 58 states. [2020-07-17 22:51:17,408 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 58 states. [2020-07-17 22:51:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,415 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-17 22:51:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-17 22:51:17,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,421 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 101 states. [2020-07-17 22:51:17,421 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 101 states. [2020-07-17 22:51:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,430 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-17 22:51:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-17 22:51:17,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:17,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:17,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-17 22:51:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2020-07-17 22:51:17,444 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2020-07-17 22:51:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:17,445 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2020-07-17 22:51:17,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2020-07-17 22:51:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:51:17,447 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:17,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:17,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:51:17,452 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-17 22:51:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -597364152, now seen corresponding path program 1 times [2020-07-17 22:51:17,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:17,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466577723] [2020-07-17 22:51:17,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:17,532 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-17 22:51:17,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-17 22:51:17,533 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {852#true} {852#true} #147#return; {852#true} is VALID [2020-07-17 22:51:17,534 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-17 22:51:17,535 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-17 22:51:17,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-17 22:51:17,535 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} #147#return; {852#true} is VALID [2020-07-17 22:51:17,536 INFO L263 TraceCheckUtils]: 4: Hoare triple {852#true} call #t~ret3 := main(); {852#true} is VALID [2020-07-17 22:51:17,536 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-17 22:51:17,537 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-17 22:51:17,538 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-17 22:51:17,539 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-17 22:51:17,541 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-17 22:51:17,541 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-17 22:51:17,543 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-17 22:51:17,544 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-17 22:51:17,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {853#false} assume !false; {853#false} is VALID [2020-07-17 22:51:17,546 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-17 22:51:17,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466577723] [2020-07-17 22:51:17,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:17,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:17,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841939778] [2020-07-17 22:51:17,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:51:17,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:17,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:17,572 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-17 22:51:17,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:17,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:17,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:17,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:17,573 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2020-07-17 22:51:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:17,970 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-07-17 22:51:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:17,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:51:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2020-07-17 22:51:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2020-07-17 22:51:17,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2020-07-17 22:51:18,109 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-17 22:51:18,112 INFO L225 Difference]: With dead ends: 75 [2020-07-17 22:51:18,112 INFO L226 Difference]: Without dead ends: 73 [2020-07-17 22:51:18,113 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-17 22:51:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-17 22:51:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2020-07-17 22:51:18,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:18,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 56 states. [2020-07-17 22:51:18,149 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 56 states. [2020-07-17 22:51:18,149 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 56 states. [2020-07-17 22:51:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,153 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-17 22:51:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-17 22:51:18,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,154 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 73 states. [2020-07-17 22:51:18,155 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 73 states. [2020-07-17 22:51:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,159 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-17 22:51:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-17 22:51:18,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:18,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:51:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-17 22:51:18,175 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2020-07-17 22:51:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:18,176 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-17 22:51:18,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-17 22:51:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:51:18,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:18,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:18,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:51:18,178 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-17 22:51:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1240184593, now seen corresponding path program 1 times [2020-07-17 22:51:18,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:18,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14919439] [2020-07-17 22:51:18,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:18,258 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-17 22:51:18,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {1163#true} assume true; {1163#true} is VALID [2020-07-17 22:51:18,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1163#true} {1163#true} #147#return; {1163#true} is VALID [2020-07-17 22:51:18,261 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-17 22:51:18,261 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-17 22:51:18,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {1163#true} assume true; {1163#true} is VALID [2020-07-17 22:51:18,262 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1163#true} {1163#true} #147#return; {1163#true} is VALID [2020-07-17 22:51:18,262 INFO L263 TraceCheckUtils]: 4: Hoare triple {1163#true} call #t~ret3 := main(); {1163#true} is VALID [2020-07-17 22:51:18,262 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-17 22:51:18,263 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-17 22:51:18,264 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-17 22:51:18,265 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-17 22:51:18,266 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-17 22:51:18,267 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-17 22:51:18,268 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-17 22:51:18,269 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-17 22:51:18,270 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-17 22:51:18,270 INFO L280 TraceCheckUtils]: 14: Hoare triple {1164#false} assume !false; {1164#false} is VALID [2020-07-17 22:51:18,271 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-17 22:51:18,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14919439] [2020-07-17 22:51:18,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:18,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:18,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570797806] [2020-07-17 22:51:18,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-17 22:51:18,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:18,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:18,290 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-17 22:51:18,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:18,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:18,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:18,291 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-07-17 22:51:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,738 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2020-07-17 22:51:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:18,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-17 22:51:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2020-07-17 22:51:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2020-07-17 22:51:18,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2020-07-17 22:51:18,899 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-17 22:51:18,901 INFO L225 Difference]: With dead ends: 96 [2020-07-17 22:51:18,902 INFO L226 Difference]: Without dead ends: 94 [2020-07-17 22:51:18,903 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-17 22:51:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-17 22:51:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2020-07-17 22:51:18,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:18,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 54 states. [2020-07-17 22:51:18,935 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 54 states. [2020-07-17 22:51:18,936 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 54 states. [2020-07-17 22:51:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,940 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2020-07-17 22:51:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-17 22:51:18,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,941 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 94 states. [2020-07-17 22:51:18,941 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 94 states. [2020-07-17 22:51:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:18,945 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2020-07-17 22:51:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-17 22:51:18,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:18,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:18,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:18,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-17 22:51:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-07-17 22:51:18,949 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2020-07-17 22:51:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:18,949 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-07-17 22:51:18,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-17 22:51:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:51:18,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:18,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:18,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:51:18,951 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-17 22:51:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 208986383, now seen corresponding path program 1 times [2020-07-17 22:51:18,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:18,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233361961] [2020-07-17 22:51:18,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:19,078 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-17 22:51:19,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-17 22:51:19,079 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1535#true} {1535#true} #147#return; {1535#true} is VALID [2020-07-17 22:51:19,081 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-17 22:51:19,081 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-17 22:51:19,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-17 22:51:19,082 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #147#return; {1535#true} is VALID [2020-07-17 22:51:19,082 INFO L263 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret3 := main(); {1535#true} is VALID [2020-07-17 22:51:19,083 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-17 22:51:19,084 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-17 22:51:19,086 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-17 22:51:19,089 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-17 22:51:19,091 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-17 22:51:19,092 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-17 22:51:19,093 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-17 22:51:19,094 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-17 22:51:19,096 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-17 22:51:19,097 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-17 22:51:19,097 INFO L280 TraceCheckUtils]: 15: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2020-07-17 22:51:19,098 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-17 22:51:19,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233361961] [2020-07-17 22:51:19,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:19,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:19,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011179659] [2020-07-17 22:51:19,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:51:19,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:19,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:19,122 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-17 22:51:19,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:19,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:19,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:19,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:19,124 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2020-07-17 22:51:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,833 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-07-17 22:51:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:19,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:51:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-17 22:51:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-17 22:51:19,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2020-07-17 22:51:20,028 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-17 22:51:20,030 INFO L225 Difference]: With dead ends: 95 [2020-07-17 22:51:20,031 INFO L226 Difference]: Without dead ends: 93 [2020-07-17 22:51:20,031 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-17 22:51:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-17 22:51:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2020-07-17 22:51:20,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:20,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 52 states. [2020-07-17 22:51:20,065 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 52 states. [2020-07-17 22:51:20,065 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 52 states. [2020-07-17 22:51:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,069 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-17 22:51:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-07-17 22:51:20,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,070 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 93 states. [2020-07-17 22:51:20,070 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 93 states. [2020-07-17 22:51:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,074 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-17 22:51:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-07-17 22:51:20,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:20,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-17 22:51:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-07-17 22:51:20,078 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2020-07-17 22:51:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:20,078 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-07-17 22:51:20,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-17 22:51:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:51:20,079 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:20,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:20,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:51:20,080 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-17 22:51:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1458792136, now seen corresponding path program 1 times [2020-07-17 22:51:20,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:20,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572846782] [2020-07-17 22:51:20,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,160 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-17 22:51:20,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:51:20,160 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #147#return; {1907#true} is VALID [2020-07-17 22:51:20,162 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-17 22:51:20,162 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-17 22:51:20,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:51:20,162 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #147#return; {1907#true} is VALID [2020-07-17 22:51:20,163 INFO L263 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret3 := main(); {1907#true} is VALID [2020-07-17 22:51:20,163 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-17 22:51:20,163 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-17 22:51:20,165 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-17 22:51:20,166 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-17 22:51:20,166 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-17 22:51:20,167 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-17 22:51:20,168 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-17 22:51:20,169 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-17 22:51:20,171 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-17 22:51:20,175 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-17 22:51:20,175 INFO L280 TraceCheckUtils]: 15: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2020-07-17 22:51:20,176 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-17 22:51:20,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572846782] [2020-07-17 22:51:20,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:20,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:20,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709031612] [2020-07-17 22:51:20,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 22:51:20,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:20,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:20,198 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-17 22:51:20,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:20,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:20,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:20,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:20,200 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2020-07-17 22:51:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,658 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-17 22:51:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:20,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 22:51:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-17 22:51:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-17 22:51:20,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-17 22:51:20,793 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-17 22:51:20,795 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:51:20,796 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 22:51:20,797 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-17 22:51:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 22:51:20,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2020-07-17 22:51:20,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:20,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 50 states. [2020-07-17 22:51:20,843 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 50 states. [2020-07-17 22:51:20,843 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 50 states. [2020-07-17 22:51:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,846 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:51:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:51:20,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,847 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 67 states. [2020-07-17 22:51:20,847 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 67 states. [2020-07-17 22:51:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:20,850 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:51:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:51:20,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:20,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:20,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:20,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 22:51:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-17 22:51:20,854 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2020-07-17 22:51:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:20,854 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-17 22:51:20,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-17 22:51:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:51:20,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:20,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:20,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:51:20,857 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-17 22:51:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2111353611, now seen corresponding path program 1 times [2020-07-17 22:51:20,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:20,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685279917] [2020-07-17 22:51:20,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:20,960 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-17 22:51:20,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {2198#true} assume true; {2198#true} is VALID [2020-07-17 22:51:20,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2198#true} {2198#true} #147#return; {2198#true} is VALID [2020-07-17 22:51:20,962 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-17 22:51:20,963 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-17 22:51:20,963 INFO L280 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2020-07-17 22:51:20,963 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #147#return; {2198#true} is VALID [2020-07-17 22:51:20,963 INFO L263 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret3 := main(); {2198#true} is VALID [2020-07-17 22:51:20,963 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-17 22:51:20,964 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-17 22:51:20,964 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-17 22:51:20,966 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-17 22:51:20,966 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-17 22:51:20,967 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-17 22:51:20,968 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-17 22:51:20,971 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-17 22:51:20,972 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-17 22:51:20,974 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-17 22:51:20,981 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-17 22:51:20,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2020-07-17 22:51:20,982 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-17 22:51:20,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685279917] [2020-07-17 22:51:20,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:20,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:20,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114988466] [2020-07-17 22:51:20,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:51:20,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:20,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:21,003 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-17 22:51:21,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:21,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:21,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:21,005 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2020-07-17 22:51:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,432 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2020-07-17 22:51:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:21,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:51:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-17 22:51:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-17 22:51:21,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2020-07-17 22:51:21,580 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-17 22:51:21,583 INFO L225 Difference]: With dead ends: 91 [2020-07-17 22:51:21,583 INFO L226 Difference]: Without dead ends: 89 [2020-07-17 22:51:21,584 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-17 22:51:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-17 22:51:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2020-07-17 22:51:21,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:21,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 48 states. [2020-07-17 22:51:21,621 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 48 states. [2020-07-17 22:51:21,621 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 48 states. [2020-07-17 22:51:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,625 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2020-07-17 22:51:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-17 22:51:21,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:21,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:21,625 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 89 states. [2020-07-17 22:51:21,626 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 89 states. [2020-07-17 22:51:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:21,628 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2020-07-17 22:51:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-17 22:51:21,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:21,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:21,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:21,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 22:51:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-17 22:51:21,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2020-07-17 22:51:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:21,632 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-17 22:51:21,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-17 22:51:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:51:21,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:21,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:21,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:51:21,633 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-17 22:51:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2022080917, now seen corresponding path program 1 times [2020-07-17 22:51:21,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:21,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358480181] [2020-07-17 22:51:21,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:21,733 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-17 22:51:21,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-17 22:51:21,733 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #147#return; {2550#true} is VALID [2020-07-17 22:51:21,734 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-17 22:51:21,735 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-17 22:51:21,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-17 22:51:21,735 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #147#return; {2550#true} is VALID [2020-07-17 22:51:21,735 INFO L263 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret3 := main(); {2550#true} is VALID [2020-07-17 22:51:21,736 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-17 22:51:21,736 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-17 22:51:21,736 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-17 22:51:21,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {2550#true} assume ~main__i~0 < ~main__len~0; {2550#true} is VALID [2020-07-17 22:51:21,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {2550#true} assume ~main__j~0 < ~main__limit~0; {2550#true} is VALID [2020-07-17 22:51:21,736 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-17 22:51:21,738 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-17 22:51:21,744 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-17 22:51:21,745 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-17 22:51:21,747 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-17 22:51:21,751 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-17 22:51:21,751 INFO L280 TraceCheckUtils]: 16: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2020-07-17 22:51:21,752 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-17 22:51:21,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358480181] [2020-07-17 22:51:21,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:21,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:21,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491137936] [2020-07-17 22:51:21,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:51:21,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:21,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:21,774 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-17 22:51:21,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:21,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:21,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:21,776 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2020-07-17 22:51:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:22,332 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-17 22:51:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:22,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:51:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2020-07-17 22:51:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2020-07-17 22:51:22,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2020-07-17 22:51:22,467 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-17 22:51:22,469 INFO L225 Difference]: With dead ends: 73 [2020-07-17 22:51:22,469 INFO L226 Difference]: Without dead ends: 71 [2020-07-17 22:51:22,470 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-17 22:51:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-17 22:51:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-07-17 22:51:22,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:22,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 46 states. [2020-07-17 22:51:22,523 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 46 states. [2020-07-17 22:51:22,524 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 46 states. [2020-07-17 22:51:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:22,527 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-07-17 22:51:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-17 22:51:22,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:22,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:22,527 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 71 states. [2020-07-17 22:51:22,527 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 71 states. [2020-07-17 22:51:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:22,530 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-07-17 22:51:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-17 22:51:22,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:22,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:22,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:22,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:51:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-17 22:51:22,533 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2020-07-17 22:51:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:22,533 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-17 22:51:22,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-17 22:51:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:51:22,534 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:22,535 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-17 22:51:22,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:51:22,535 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-17 22:51:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1740004142, now seen corresponding path program 1 times [2020-07-17 22:51:22,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:22,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201148954] [2020-07-17 22:51:22,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:22,614 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-17 22:51:22,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {2855#true} assume true; {2855#true} is VALID [2020-07-17 22:51:22,615 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2855#true} {2855#true} #147#return; {2855#true} is VALID [2020-07-17 22:51:22,616 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-17 22:51:22,616 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-17 22:51:22,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {2855#true} assume true; {2855#true} is VALID [2020-07-17 22:51:22,617 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} #147#return; {2855#true} is VALID [2020-07-17 22:51:22,617 INFO L263 TraceCheckUtils]: 4: Hoare triple {2855#true} call #t~ret3 := main(); {2855#true} is VALID [2020-07-17 22:51:22,618 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-17 22:51:22,619 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-17 22:51:22,620 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-17 22:51:22,621 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-17 22:51:22,622 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-17 22:51:22,622 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-17 22:51:22,623 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-17 22:51:22,624 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-17 22:51:22,624 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-17 22:51:22,625 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-17 22:51:22,626 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-17 22:51:22,627 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-17 22:51:22,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {2856#false} assume !false; {2856#false} is VALID [2020-07-17 22:51:22,629 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-17 22:51:22,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201148954] [2020-07-17 22:51:22,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:22,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:22,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400289614] [2020-07-17 22:51:22,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-17 22:51:22,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:22,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:22,655 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-17 22:51:22,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:22,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:22,657 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2020-07-17 22:51:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:23,140 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-07-17 22:51:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:23,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-17 22:51:23,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-17 22:51:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-17 22:51:23,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2020-07-17 22:51:23,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:23,279 INFO L225 Difference]: With dead ends: 61 [2020-07-17 22:51:23,279 INFO L226 Difference]: Without dead ends: 59 [2020-07-17 22:51:23,280 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-17 22:51:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-17 22:51:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2020-07-17 22:51:23,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:23,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 44 states. [2020-07-17 22:51:23,343 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 44 states. [2020-07-17 22:51:23,343 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 44 states. [2020-07-17 22:51:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:23,348 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-17 22:51:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-17 22:51:23,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:23,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:23,349 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 59 states. [2020-07-17 22:51:23,350 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 59 states. [2020-07-17 22:51:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:23,352 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-17 22:51:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-17 22:51:23,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:23,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:23,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:23,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:51:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-07-17 22:51:23,356 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2020-07-17 22:51:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:23,356 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-07-17 22:51:23,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-17 22:51:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:51:23,357 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:23,358 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-17 22:51:23,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:51:23,358 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-17 22:51:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1894443311, now seen corresponding path program 1 times [2020-07-17 22:51:23,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:23,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001022575] [2020-07-17 22:51:23,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:23,533 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-17 22:51:23,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {3117#true} assume true; {3117#true} is VALID [2020-07-17 22:51:23,534 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3117#true} {3117#true} #147#return; {3117#true} is VALID [2020-07-17 22:51:23,535 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-17 22:51:23,536 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-17 22:51:23,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {3117#true} assume true; {3117#true} is VALID [2020-07-17 22:51:23,536 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3117#true} {3117#true} #147#return; {3117#true} is VALID [2020-07-17 22:51:23,537 INFO L263 TraceCheckUtils]: 4: Hoare triple {3117#true} call #t~ret3 := main(); {3117#true} is VALID [2020-07-17 22:51:23,537 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-17 22:51:23,537 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-17 22:51:23,538 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-17 22:51:23,539 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-17 22:51:23,539 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-17 22:51:23,540 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-17 22:51:23,541 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-17 22:51:23,543 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-17 22:51:23,544 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-17 22:51:23,545 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-17 22:51:23,545 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-17 22:51:23,546 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-17 22:51:23,547 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-17 22:51:23,548 INFO L280 TraceCheckUtils]: 18: Hoare triple {3118#false} assume !false; {3118#false} is VALID [2020-07-17 22:51:23,548 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-17 22:51:23,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001022575] [2020-07-17 22:51:23,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:23,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:23,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78895772] [2020-07-17 22:51:23,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:51:23,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:23,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:23,581 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-17 22:51:23,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:23,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:23,583 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2020-07-17 22:51:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:23,936 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-07-17 22:51:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:23,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:51:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-17 22:51:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-17 22:51:23,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-17 22:51:24,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:24,045 INFO L225 Difference]: With dead ends: 61 [2020-07-17 22:51:24,045 INFO L226 Difference]: Without dead ends: 59 [2020-07-17 22:51:24,045 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-17 22:51:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-17 22:51:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-07-17 22:51:24,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:24,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 42 states. [2020-07-17 22:51:24,094 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 42 states. [2020-07-17 22:51:24,094 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 42 states. [2020-07-17 22:51:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,096 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-17 22:51:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-17 22:51:24,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,097 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 59 states. [2020-07-17 22:51:24,097 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 59 states. [2020-07-17 22:51:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,098 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-17 22:51:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-17 22:51:24,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:24,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:51:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-07-17 22:51:24,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2020-07-17 22:51:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:24,100 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-07-17 22:51:24,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-17 22:51:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:51:24,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:24,101 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-17 22:51:24,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:51:24,101 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-17 22:51:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1401802644, now seen corresponding path program 1 times [2020-07-17 22:51:24,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:24,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147683475] [2020-07-17 22:51:24,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,193 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-17 22:51:24,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {3373#true} assume true; {3373#true} is VALID [2020-07-17 22:51:24,193 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3373#true} {3373#true} #147#return; {3373#true} is VALID [2020-07-17 22:51:24,200 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-17 22:51:24,200 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-17 22:51:24,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {3373#true} assume true; {3373#true} is VALID [2020-07-17 22:51:24,201 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3373#true} {3373#true} #147#return; {3373#true} is VALID [2020-07-17 22:51:24,201 INFO L263 TraceCheckUtils]: 4: Hoare triple {3373#true} call #t~ret3 := main(); {3373#true} is VALID [2020-07-17 22:51:24,201 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-17 22:51:24,201 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-17 22:51:24,202 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-17 22:51:24,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {3373#true} assume ~main__i~0 < ~main__len~0; {3373#true} is VALID [2020-07-17 22:51:24,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {3373#true} assume ~main__j~0 < ~main__limit~0; {3373#true} is VALID [2020-07-17 22:51:24,210 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-17 22:51:24,211 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-17 22:51:24,212 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-17 22:51:24,213 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-17 22:51:24,213 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-17 22:51:24,214 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-17 22:51:24,215 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-17 22:51:24,216 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-17 22:51:24,216 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-17 22:51:24,217 INFO L280 TraceCheckUtils]: 19: Hoare triple {3374#false} assume !false; {3374#false} is VALID [2020-07-17 22:51:24,217 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-17 22:51:24,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147683475] [2020-07-17 22:51:24,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:24,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:24,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353665989] [2020-07-17 22:51:24,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:51:24,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:24,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:24,246 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-17 22:51:24,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:24,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:24,247 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-07-17 22:51:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,707 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-17 22:51:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:24,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:51:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-17 22:51:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-17 22:51:24,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2020-07-17 22:51:24,825 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-17 22:51:24,826 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:51:24,826 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 22:51:24,827 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-17 22:51:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 22:51:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2020-07-17 22:51:24,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:24,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 40 states. [2020-07-17 22:51:24,885 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 40 states. [2020-07-17 22:51:24,885 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 40 states. [2020-07-17 22:51:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,887 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:51:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:51:24,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,890 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 67 states. [2020-07-17 22:51:24,890 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 67 states. [2020-07-17 22:51:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,892 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:51:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:51:24,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:24,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:51:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-17 22:51:24,895 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2020-07-17 22:51:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:24,895 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-17 22:51:24,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-17 22:51:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:51:24,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:24,896 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-17 22:51:24,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:51:24,897 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-17 22:51:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash 506212151, now seen corresponding path program 1 times [2020-07-17 22:51:24,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:24,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121673947] [2020-07-17 22:51:24,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,992 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-17 22:51:24,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {3655#true} assume true; {3655#true} is VALID [2020-07-17 22:51:24,993 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3655#true} {3655#true} #147#return; {3655#true} is VALID [2020-07-17 22:51:24,994 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-17 22:51:24,994 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-17 22:51:24,994 INFO L280 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2020-07-17 22:51:24,995 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #147#return; {3655#true} is VALID [2020-07-17 22:51:24,995 INFO L263 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret3 := main(); {3655#true} is VALID [2020-07-17 22:51:24,995 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-17 22:51:24,996 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-17 22:51:24,997 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-17 22:51:24,997 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-17 22:51:24,998 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-17 22:51:24,998 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-17 22:51:24,998 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-17 22:51:24,999 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-17 22:51:24,999 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-17 22:51:25,000 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-17 22:51:25,000 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-17 22:51:25,001 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-17 22:51:25,002 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-17 22:51:25,003 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-17 22:51:25,004 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-17 22:51:25,005 INFO L280 TraceCheckUtils]: 20: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2020-07-17 22:51:25,005 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-17 22:51:25,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121673947] [2020-07-17 22:51:25,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:25,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:25,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891003349] [2020-07-17 22:51:25,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-17 22:51:25,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:25,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:25,034 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-17 22:51:25,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:25,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:25,036 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2020-07-17 22:51:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:25,603 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-07-17 22:51:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:25,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-17 22:51:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-17 22:51:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-17 22:51:25,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2020-07-17 22:51:25,739 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-17 22:51:25,741 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:51:25,742 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 22:51:25,742 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-17 22:51:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 22:51:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2020-07-17 22:51:25,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:25,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 38 states. [2020-07-17 22:51:25,813 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 38 states. [2020-07-17 22:51:25,814 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 38 states. [2020-07-17 22:51:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:25,816 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-17 22:51:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-17 22:51:25,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:25,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:25,817 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 72 states. [2020-07-17 22:51:25,817 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 72 states. [2020-07-17 22:51:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:25,820 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-17 22:51:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-17 22:51:25,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:25,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:25,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:25,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:51:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-07-17 22:51:25,823 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2020-07-17 22:51:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:25,823 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-07-17 22:51:25,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-17 22:51:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:51:25,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:25,824 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-17 22:51:25,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:51:25,825 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-17 22:51:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1487289350, now seen corresponding path program 1 times [2020-07-17 22:51:25,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:25,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827814369] [2020-07-17 22:51:25,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,960 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-17 22:51:25,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {3951#true} assume true; {3951#true} is VALID [2020-07-17 22:51:25,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3951#true} {3951#true} #147#return; {3951#true} is VALID [2020-07-17 22:51:25,963 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-17 22:51:25,964 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-17 22:51:25,964 INFO L280 TraceCheckUtils]: 2: Hoare triple {3951#true} assume true; {3951#true} is VALID [2020-07-17 22:51:25,965 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3951#true} {3951#true} #147#return; {3951#true} is VALID [2020-07-17 22:51:25,965 INFO L263 TraceCheckUtils]: 4: Hoare triple {3951#true} call #t~ret3 := main(); {3951#true} is VALID [2020-07-17 22:51:25,965 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-17 22:51:25,967 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-17 22:51:25,970 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-17 22:51:25,972 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-17 22:51:25,974 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-17 22:51:25,977 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-17 22:51:25,979 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-17 22:51:25,980 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-17 22:51:25,981 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-17 22:51:25,981 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-17 22:51:25,982 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-17 22:51:25,983 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-17 22:51:25,984 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-17 22:51:25,985 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-17 22:51:25,986 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-17 22:51:25,987 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-17 22:51:25,988 INFO L280 TraceCheckUtils]: 21: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2020-07-17 22:51:25,989 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-17 22:51:25,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827814369] [2020-07-17 22:51:25,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:25,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:51:25,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801084272] [2020-07-17 22:51:25,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:51:25,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:25,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:51:26,017 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-17 22:51:26,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:51:26,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:51:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:26,018 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2020-07-17 22:51:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:26,700 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-07-17 22:51:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:51:26,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:51:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-17 22:51:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-17 22:51:26,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2020-07-17 22:51:26,826 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-17 22:51:26,828 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:51:26,828 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 22:51:26,829 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-17 22:51:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 22:51:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2020-07-17 22:51:26,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:26,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 36 states. [2020-07-17 22:51:26,872 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 36 states. [2020-07-17 22:51:26,872 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 36 states. [2020-07-17 22:51:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:26,875 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-17 22:51:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-07-17 22:51:26,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:26,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:26,876 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 60 states. [2020-07-17 22:51:26,876 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 60 states. [2020-07-17 22:51:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:26,878 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-17 22:51:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-07-17 22:51:26,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:26,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:26,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:26,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:51:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-07-17 22:51:26,881 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2020-07-17 22:51:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:26,881 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-07-17 22:51:26,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:51:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-17 22:51:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:51:26,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:26,882 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-17 22:51:26,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:51:26,883 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-17 22:51:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:26,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1138673565, now seen corresponding path program 1 times [2020-07-17 22:51:26,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:26,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664812158] [2020-07-17 22:51:26,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:26,977 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-17 22:51:26,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {4216#true} assume true; {4216#true} is VALID [2020-07-17 22:51:26,978 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4216#true} {4216#true} #147#return; {4216#true} is VALID [2020-07-17 22:51:26,980 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-17 22:51:26,980 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-17 22:51:26,981 INFO L280 TraceCheckUtils]: 2: Hoare triple {4216#true} assume true; {4216#true} is VALID [2020-07-17 22:51:26,981 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4216#true} {4216#true} #147#return; {4216#true} is VALID [2020-07-17 22:51:26,981 INFO L263 TraceCheckUtils]: 4: Hoare triple {4216#true} call #t~ret3 := main(); {4216#true} is VALID [2020-07-17 22:51:26,981 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-17 22:51:26,982 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-17 22:51:26,983 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-17 22:51:26,984 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-17 22:51:26,985 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-17 22:51:26,986 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-17 22:51:26,987 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-17 22:51:26,988 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-17 22:51:26,990 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-17 22:51:26,991 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-17 22:51:26,992 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-17 22:51:26,993 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-17 22:51:26,995 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-17 22:51:26,996 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-17 22:51:26,997 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-17 22:51:26,999 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-17 22:51:27,000 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-17 22:51:27,001 INFO L280 TraceCheckUtils]: 22: Hoare triple {4217#false} assume !false; {4217#false} is VALID [2020-07-17 22:51:27,002 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-17 22:51:27,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664812158] [2020-07-17 22:51:27,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:27,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:27,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479306217] [2020-07-17 22:51:27,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:51:27,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:27,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:27,041 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-17 22:51:27,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:27,043 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2020-07-17 22:51:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:27,728 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-07-17 22:51:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:27,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:51:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-17 22:51:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-17 22:51:27,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2020-07-17 22:51:27,912 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-17 22:51:27,914 INFO L225 Difference]: With dead ends: 87 [2020-07-17 22:51:27,914 INFO L226 Difference]: Without dead ends: 85 [2020-07-17 22:51:27,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-17 22:51:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2020-07-17 22:51:27,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:27,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 34 states. [2020-07-17 22:51:27,994 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 34 states. [2020-07-17 22:51:27,995 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 34 states. [2020-07-17 22:51:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:27,999 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2020-07-17 22:51:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-17 22:51:28,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:28,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:28,002 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 85 states. [2020-07-17 22:51:28,002 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 85 states. [2020-07-17 22:51:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:28,006 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2020-07-17 22:51:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-17 22:51:28,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:28,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:28,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:28,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:51:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-17 22:51:28,011 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2020-07-17 22:51:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:28,011 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-17 22:51:28,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-17 22:51:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:51:28,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:28,014 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-17 22:51:28,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:51:28,015 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-17 22:51:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 939145312, now seen corresponding path program 1 times [2020-07-17 22:51:28,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:28,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860024264] [2020-07-17 22:51:28,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:28,162 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-17 22:51:28,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {4551#true} assume true; {4551#true} is VALID [2020-07-17 22:51:28,163 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4551#true} {4551#true} #147#return; {4551#true} is VALID [2020-07-17 22:51:28,164 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-17 22:51:28,164 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-17 22:51:28,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {4551#true} assume true; {4551#true} is VALID [2020-07-17 22:51:28,165 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4551#true} {4551#true} #147#return; {4551#true} is VALID [2020-07-17 22:51:28,165 INFO L263 TraceCheckUtils]: 4: Hoare triple {4551#true} call #t~ret3 := main(); {4551#true} is VALID [2020-07-17 22:51:28,165 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-17 22:51:28,166 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-17 22:51:28,168 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-17 22:51:28,168 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-17 22:51:28,170 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-17 22:51:28,171 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-17 22:51:28,171 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-17 22:51:28,172 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-17 22:51:28,173 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-17 22:51:28,174 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-17 22:51:28,174 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-17 22:51:28,177 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-17 22:51:28,179 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-17 22:51:28,181 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-17 22:51:28,182 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-17 22:51:28,182 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-17 22:51:28,184 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-17 22:51:28,185 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-17 22:51:28,185 INFO L280 TraceCheckUtils]: 23: Hoare triple {4552#false} assume !false; {4552#false} is VALID [2020-07-17 22:51:28,187 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-17 22:51:28,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860024264] [2020-07-17 22:51:28,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:28,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:51:28,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762432639] [2020-07-17 22:51:28,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:51:28,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:28,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:51:28,229 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-17 22:51:28,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:51:28,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:28,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:51:28,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:28,230 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2020-07-17 22:51:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:28,948 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-17 22:51:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:51:28,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-17 22:51:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-17 22:51:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-17 22:51:28,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-17 22:51:29,077 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-17 22:51:29,079 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:51:29,079 INFO L226 Difference]: Without dead ends: 58 [2020-07-17 22:51:29,080 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-17 22:51:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-17 22:51:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2020-07-17 22:51:29,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:29,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 32 states. [2020-07-17 22:51:29,148 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 32 states. [2020-07-17 22:51:29,149 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 32 states. [2020-07-17 22:51:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:29,151 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-07-17 22:51:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-17 22:51:29,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:29,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:29,152 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 58 states. [2020-07-17 22:51:29,152 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 58 states. [2020-07-17 22:51:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:29,155 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-07-17 22:51:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-17 22:51:29,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:29,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:29,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:29,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:51:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-17 22:51:29,158 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2020-07-17 22:51:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:29,158 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-17 22:51:29,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:51:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-17 22:51:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:51:29,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:29,160 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-17 22:51:29,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:51:29,163 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-17 22:51:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:29,163 INFO L82 PathProgramCache]: Analyzing trace with hash -951263229, now seen corresponding path program 1 times [2020-07-17 22:51:29,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:29,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52926050] [2020-07-17 22:51:29,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:29,290 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-17 22:51:29,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {4806#true} assume true; {4806#true} is VALID [2020-07-17 22:51:29,291 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4806#true} {4806#true} #147#return; {4806#true} is VALID [2020-07-17 22:51:29,294 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-17 22:51:29,295 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-17 22:51:29,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2020-07-17 22:51:29,295 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #147#return; {4806#true} is VALID [2020-07-17 22:51:29,295 INFO L263 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret3 := main(); {4806#true} is VALID [2020-07-17 22:51:29,295 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-17 22:51:29,295 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-17 22:51:29,296 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-17 22:51:29,298 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-17 22:51:29,299 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-17 22:51:29,300 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-17 22:51:29,300 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-17 22:51:29,301 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-17 22:51:29,302 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-17 22:51:29,303 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-17 22:51:29,304 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-17 22:51:29,304 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-17 22:51:29,311 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-17 22:51:29,311 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-17 22:51:29,312 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-17 22:51:29,313 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-17 22:51:29,314 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-17 22:51:29,316 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-17 22:51:29,317 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-17 22:51:29,318 INFO L280 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2020-07-17 22:51:29,319 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-17 22:51:29,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52926050] [2020-07-17 22:51:29,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:29,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:51:29,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434297041] [2020-07-17 22:51:29,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-17 22:51:29,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:29,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:51:29,364 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-17 22:51:29,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:51:29,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:51:29,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:29,366 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2020-07-17 22:51:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:30,417 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2020-07-17 22:51:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:51:30,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-17 22:51:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2020-07-17 22:51:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2020-07-17 22:51:30,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2020-07-17 22:51:30,670 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-17 22:51:30,670 INFO L225 Difference]: With dead ends: 125 [2020-07-17 22:51:30,670 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:30,672 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-17 22:51:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:30,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:30,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:30,673 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:30,673 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:30,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:30,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:30,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:30,674 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:30,675 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:30,675 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:30,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:30,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:30,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:30,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:30,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-17 22:51:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:30,677 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:30,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:51:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:30,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:30,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 22:51:30,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:31,028 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 92 [2020-07-17 22:51:31,229 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 72 [2020-07-17 22:51:31,444 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 48 [2020-07-17 22:51:31,727 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 39 [2020-07-17 22:51:31,957 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 23 [2020-07-17 22:51:32,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:32,093 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-17 22:51:32,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:32,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:32,094 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:32,094 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:32,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:32,094 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:51:32,094 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:51:32,095 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:51:32,095 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:51:32,095 INFO L268 CegarLoopResult]: For program point L225(lines 225 267) no Hoare annotation was computed. [2020-07-17 22:51:32,095 INFO L268 CegarLoopResult]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 86) no Hoare annotation was computed. [2020-07-17 22:51:32,095 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 311) no Hoare annotation was computed. [2020-07-17 22:51:32,095 INFO L268 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point L201(lines 201 271) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point L36(lines 36 292) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point L243(line 243) no Hoare annotation was computed. [2020-07-17 22:51:32,096 INFO L268 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2020-07-17 22:51:32,097 INFO L268 CegarLoopResult]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2020-07-17 22:51:32,097 INFO L268 CegarLoopResult]: For program point L227(line 227) no Hoare annotation was computed. [2020-07-17 22:51:32,097 INFO L268 CegarLoopResult]: For program point L161(lines 161 277) no Hoare annotation was computed. [2020-07-17 22:51:32,097 INFO L268 CegarLoopResult]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2020-07-17 22:51:32,098 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-17 22:51:32,098 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 311) no Hoare annotation was computed. [2020-07-17 22:51:32,098 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-17 22:51:32,098 INFO L268 CegarLoopResult]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2020-07-17 22:51:32,098 INFO L268 CegarLoopResult]: For program point L137(lines 137 281) no Hoare annotation was computed. [2020-07-17 22:51:32,098 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2020-07-17 22:51:32,098 INFO L268 CegarLoopResult]: For program point L96(lines 96 123) no Hoare annotation was computed. [2020-07-17 22:51:32,098 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 311) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2020-07-17 22:51:32,099 INFO L268 CegarLoopResult]: For program point L253(lines 253 263) no Hoare annotation was computed. [2020-07-17 22:51:32,099 INFO L268 CegarLoopResult]: For program point L55(lines 55 284) no Hoare annotation was computed. [2020-07-17 22:51:32,099 INFO L268 CegarLoopResult]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2020-07-17 22:51:32,099 INFO L268 CegarLoopResult]: For program point L72(lines 72 127) no Hoare annotation was computed. [2020-07-17 22:51:32,100 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-17 22:51:32,100 INFO L268 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2020-07-17 22:51:32,100 INFO L268 CegarLoopResult]: For program point L64(lines 64 283) no Hoare annotation was computed. [2020-07-17 22:51:32,101 INFO L268 CegarLoopResult]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2020-07-17 22:51:32,101 INFO L268 CegarLoopResult]: For program point L213(lines 213 269) no Hoare annotation was computed. [2020-07-17 22:51:32,102 INFO L268 CegarLoopResult]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2020-07-17 22:51:32,102 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-07-17 22:51:32,102 INFO L268 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-07-17 22:51:32,102 INFO L268 CegarLoopResult]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point L255(line 255) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point L189(lines 189 273) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point L173(lines 173 275) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 57) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point L215(line 215) no Hoare annotation was computed. [2020-07-17 22:51:32,103 INFO L268 CegarLoopResult]: For program point L149(lines 149 279) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point L108(lines 108 121) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point L34(lines 34 298) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point L84(lines 84 125) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point L18(lines 18 310) no Hoare annotation was computed. [2020-07-17 22:51:32,104 INFO L268 CegarLoopResult]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2020-07-17 22:51:32,105 INFO L268 CegarLoopResult]: For program point L241(lines 241 265) no Hoare annotation was computed. [2020-07-17 22:51:32,105 INFO L268 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2020-07-17 22:51:32,106 INFO L268 CegarLoopResult]: For program point L43(lines 43 286) no Hoare annotation was computed. [2020-07-17 22:51:32,106 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-17 22:51:32,112 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:32,117 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:32,117 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:32,117 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:32,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:32,118 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:51:32,119 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:51:32,119 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:32,119 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:32,119 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:32,119 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:32,119 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-17 22:51:32,120 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:32,121 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:32,122 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:32,122 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:51:32,124 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:51:32,124 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:51:32,124 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:51:32,125 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:51:32,125 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:51:32,125 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:51:32,125 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-17 22:51:32,125 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-17 22:51:32,125 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-17 22:51:32,126 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:51:32,126 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:51:32,126 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-17 22:51:32,126 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-17 22:51:32,126 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-17 22:51:32,126 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-17 22:51:32,127 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-17 22:51:32,127 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-17 22:51:32,127 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-17 22:51:32,127 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-17 22:51:32,127 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-17 22:51:32,127 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-17 22:51:32,127 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-17 22:51:32,128 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-17 22:51:32,128 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:51:32,128 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:51:32,128 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-17 22:51:32,129 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-17 22:51:32,130 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-17 22:51:32,130 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-17 22:51:32,130 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-17 22:51:32,130 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-17 22:51:32,130 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-17 22:51:32,131 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-17 22:51:32,131 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-17 22:51:32,131 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-17 22:51:32,131 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2020-07-17 22:51:32,131 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2020-07-17 22:51:32,131 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2020-07-17 22:51:32,132 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2020-07-17 22:51:32,132 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-17 22:51:32,132 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-17 22:51:32,132 WARN L170 areAnnotationChecker]: L163 has no Hoare annotation [2020-07-17 22:51:32,132 WARN L170 areAnnotationChecker]: L163 has no Hoare annotation [2020-07-17 22:51:32,132 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-17 22:51:32,132 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-17 22:51:32,133 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-17 22:51:32,133 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-17 22:51:32,133 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-17 22:51:32,133 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-17 22:51:32,133 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2020-07-17 22:51:32,133 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2020-07-17 22:51:32,133 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2020-07-17 22:51:32,134 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2020-07-17 22:51:32,134 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2020-07-17 22:51:32,134 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2020-07-17 22:51:32,134 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2020-07-17 22:51:32,134 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2020-07-17 22:51:32,134 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2020-07-17 22:51:32,134 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2020-07-17 22:51:32,135 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2020-07-17 22:51:32,135 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2020-07-17 22:51:32,135 WARN L170 areAnnotationChecker]: L227 has no Hoare annotation [2020-07-17 22:51:32,135 WARN L170 areAnnotationChecker]: L227 has no Hoare annotation [2020-07-17 22:51:32,135 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-17 22:51:32,135 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-17 22:51:32,135 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2020-07-17 22:51:32,136 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2020-07-17 22:51:32,136 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-17 22:51:32,136 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-17 22:51:32,136 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2020-07-17 22:51:32,136 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2020-07-17 22:51:32,136 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-17 22:51:32,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:32 BoogieIcfgContainer [2020-07-17 22:51:32,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:32,178 INFO L168 Benchmark]: Toolchain (without parser) took 18870.02 ms. Allocated memory was 135.8 MB in the beginning and 421.0 MB in the end (delta: 285.2 MB). Free memory was 100.4 MB in the beginning and 371.8 MB in the end (delta: -271.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:32,187 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:32,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.01 ms. Allocated memory is still 135.8 MB. Free memory was 100.0 MB in the beginning and 87.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:32,192 INFO L168 Benchmark]: Boogie Preprocessor took 138.56 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 87.0 MB in the beginning and 176.8 MB in the end (delta: -89.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:32,193 INFO L168 Benchmark]: RCFGBuilder took 730.09 ms. Allocated memory is still 199.8 MB. Free memory was 176.8 MB in the beginning and 141.8 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:32,195 INFO L168 Benchmark]: TraceAbstraction took 17475.81 ms. Allocated memory was 199.8 MB in the beginning and 421.0 MB in the end (delta: 221.2 MB). Free memory was 141.1 MB in the beginning and 371.8 MB in the end (delta: -230.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:51:32,200 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.51 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 511.01 ms. Allocated memory is still 135.8 MB. Free memory was 100.0 MB in the beginning and 87.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.56 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 87.0 MB in the beginning and 176.8 MB in the end (delta: -89.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 730.09 ms. Allocated memory is still 199.8 MB. Free memory was 176.8 MB in the beginning and 141.8 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17475.81 ms. Allocated memory was 199.8 MB in the beginning and 421.0 MB in the end (delta: 221.2 MB). Free memory was 141.1 MB in the beginning and 371.8 MB in the end (delta: -230.8 MB). There was no memory consumed. 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: 15.9s, 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.5s 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: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 148 HoareAnnotationTreeSize, 7 FomulaSimplifications, 909827071 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 37836 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s 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...