/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-46f3038-m [2020-07-08 12:46:39,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:46:39,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:46:39,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:46:39,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:46:39,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:46:39,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:46:39,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:46:39,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:46:39,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:46:39,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:46:39,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:46:39,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:46:39,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:46:39,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:46:39,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:46:39,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:46:39,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:46:39,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:46:39,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:46:39,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:46:39,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:46:39,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:46:39,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:46:39,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:46:39,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:46:39,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:46:39,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:46:39,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:46:39,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:46:39,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:46:39,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:46:39,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:46:39,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:46:39,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:46:39,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:46:39,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:46:39,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:46:39,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:46:39,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:46:39,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:46:39,212 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-08 12:46:39,235 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:46:39,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:46:39,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:46:39,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:46:39,237 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:46:39,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:46:39,237 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:46:39,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:46:39,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:46:39,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:46:39,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:46:39,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:46:39,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:46:39,239 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:46:39,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:46:39,239 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:46:39,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:46:39,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:46:39,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:46:39,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:46:39,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:46:39,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:46:39,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:46:39,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:46:39,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:46:39,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:46:39,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:46:39,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:46:39,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:46:39,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:46:39,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:46:39,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:46:39,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:46:39,560 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:46:39,561 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:46:39,562 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-08 12:46:39,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4504d6ff/b9fbaa457fcd4ee78c13b9516d9bbe29/FLAGc552d5f12 [2020-07-08 12:46:40,216 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:46:40,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-07-08 12:46:40,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4504d6ff/b9fbaa457fcd4ee78c13b9516d9bbe29/FLAGc552d5f12 [2020-07-08 12:46:40,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4504d6ff/b9fbaa457fcd4ee78c13b9516d9bbe29 [2020-07-08 12:46:40,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:46:40,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:46:40,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:40,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:46:40,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:46:40,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:40,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38be9ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40, skipping insertion in model container [2020-07-08 12:46:40,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:40,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:46:40,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:46:40,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:40,817 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:46:40,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:40,883 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:46:40,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40 WrapperNode [2020-07-08 12:46:40,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:40,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:46:40,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:46:40,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:46:40,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:40,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:41,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:41,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:41,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:41,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:41,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (1/1) ... [2020-07-08 12:46:41,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:46:41,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:46:41,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:46:41,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:46:41,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (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-08 12:46:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:46:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:46:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:46:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:46:41,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:46:41,119 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:46:41,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:46:41,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:46:41,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:46:41,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:46:41,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:46:41,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:46:41,710 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:46:41,711 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:46:41,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:41 BoogieIcfgContainer [2020-07-08 12:46:41,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:46:41,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:46:41,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:46:41,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:46:41,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:46:40" (1/3) ... [2020-07-08 12:46:41,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f90253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:41, skipping insertion in model container [2020-07-08 12:46:41,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:40" (2/3) ... [2020-07-08 12:46:41,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f90253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:41, skipping insertion in model container [2020-07-08 12:46:41,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:41" (3/3) ... [2020-07-08 12:46:41,738 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2020-07-08 12:46:41,751 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:46:41,766 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-08 12:46:41,783 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-08 12:46:41,830 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:46:41,830 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:46:41,831 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:46:41,831 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:46:41,831 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:46:41,832 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:46:41,832 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:46:41,832 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:46:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-08 12:46:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:46:41,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:41,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:41,892 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-08 12:46:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1781845407, now seen corresponding path program 1 times [2020-07-08 12:46:41,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:41,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309915177] [2020-07-08 12:46:41,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:42,171 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-08 12:46:42,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 12:46:42,173 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} #147#return; {68#true} is VALID [2020-07-08 12:46:42,177 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-08 12:46:42,178 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-08 12:46:42,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 12:46:42,179 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #147#return; {68#true} is VALID [2020-07-08 12:46:42,179 INFO L263 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret3 := main(); {68#true} is VALID [2020-07-08 12:46:42,180 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-08 12:46:42,180 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-08 12:46:42,181 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-08 12:46:42,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2020-07-08 12:46:42,182 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2020-07-08 12:46:42,184 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-08 12:46:42,185 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-08 12:46:42,185 INFO L280 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-08 12:46:42,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-08 12:46:42,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309915177] [2020-07-08 12:46:42,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:42,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:46:42,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261431273] [2020-07-08 12:46:42,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-08 12:46:42,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:42,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:46:42,233 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-08 12:46:42,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:46:42,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:46:42,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:46:42,248 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2020-07-08 12:46:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:42,687 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2020-07-08 12:46:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:42,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-08 12:46:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2020-07-08 12:46:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:46:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2020-07-08 12:46:42,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2020-07-08 12:46:42,890 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-08 12:46:42,910 INFO L225 Difference]: With dead ends: 90 [2020-07-08 12:46:42,911 INFO L226 Difference]: Without dead ends: 76 [2020-07-08 12:46:42,916 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-08 12:46:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-08 12:46:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2020-07-08 12:46:43,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:43,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 59 states. [2020-07-08 12:46:43,009 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 59 states. [2020-07-08 12:46:43,009 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 59 states. [2020-07-08 12:46:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:43,022 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-07-08 12:46:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-07-08 12:46:43,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:43,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:43,025 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 76 states. [2020-07-08 12:46:43,026 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 76 states. [2020-07-08 12:46:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:43,040 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-07-08 12:46:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-07-08 12:46:43,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:43,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:43,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:43,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 12:46:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-07-08 12:46:43,055 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2020-07-08 12:46:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:43,056 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-08 12:46:43,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:46:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-08 12:46:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:46:43,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:43,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:43,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:46:43,060 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-08 12:46:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:43,061 INFO L82 PathProgramCache]: Analyzing trace with hash -594195383, now seen corresponding path program 1 times [2020-07-08 12:46:43,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:43,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296044679] [2020-07-08 12:46:43,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:43,202 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-08 12:46:43,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {398#true} assume true; {398#true} is VALID [2020-07-08 12:46:43,203 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} #147#return; {398#true} is VALID [2020-07-08 12:46:43,204 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-08 12:46:43,205 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-08 12:46:43,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2020-07-08 12:46:43,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #147#return; {398#true} is VALID [2020-07-08 12:46:43,206 INFO L263 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret3 := main(); {398#true} is VALID [2020-07-08 12:46:43,206 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-08 12:46:43,207 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-08 12:46:43,208 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-08 12:46:43,209 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-08 12:46:43,210 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-08 12:46:43,211 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-08 12:46:43,213 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-08 12:46:43,215 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-08 12:46:43,215 INFO L280 TraceCheckUtils]: 13: Hoare triple {399#false} assume !false; {399#false} is VALID [2020-07-08 12:46:43,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-08 12:46:43,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296044679] [2020-07-08 12:46:43,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:43,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:43,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628778128] [2020-07-08 12:46:43,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 12:46:43,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:43,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:43,243 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-08 12:46:43,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:43,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:43,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:43,244 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2020-07-08 12:46:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:43,904 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2020-07-08 12:46:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:43,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 12:46:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-08 12:46:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-08 12:46:43,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2020-07-08 12:46:44,146 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-08 12:46:44,152 INFO L225 Difference]: With dead ends: 153 [2020-07-08 12:46:44,153 INFO L226 Difference]: Without dead ends: 101 [2020-07-08 12:46:44,154 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-08 12:46:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-08 12:46:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2020-07-08 12:46:44,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:44,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 58 states. [2020-07-08 12:46:44,177 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 58 states. [2020-07-08 12:46:44,178 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 58 states. [2020-07-08 12:46:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:44,183 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-08 12:46:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-08 12:46:44,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:44,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:44,185 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 101 states. [2020-07-08 12:46:44,185 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 101 states. [2020-07-08 12:46:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:44,191 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-08 12:46:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-08 12:46:44,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:44,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:44,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:44,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-08 12:46:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2020-07-08 12:46:44,196 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2020-07-08 12:46:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:44,197 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2020-07-08 12:46:44,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2020-07-08 12:46:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:46:44,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:44,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:44,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:46:44,199 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-08 12:46:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:44,199 INFO L82 PathProgramCache]: Analyzing trace with hash -597364152, now seen corresponding path program 1 times [2020-07-08 12:46:44,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:44,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969550902] [2020-07-08 12:46:44,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:44,272 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-08 12:46:44,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-08 12:46:44,273 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {852#true} {852#true} #147#return; {852#true} is VALID [2020-07-08 12:46:44,274 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-08 12:46:44,275 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-08 12:46:44,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-08 12:46:44,275 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} #147#return; {852#true} is VALID [2020-07-08 12:46:44,275 INFO L263 TraceCheckUtils]: 4: Hoare triple {852#true} call #t~ret3 := main(); {852#true} is VALID [2020-07-08 12:46:44,276 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-08 12:46:44,277 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-08 12:46:44,278 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-08 12:46:44,278 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-08 12:46:44,279 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-08 12:46:44,280 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-08 12:46:44,281 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-08 12:46:44,282 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-08 12:46:44,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {853#false} assume !false; {853#false} is VALID [2020-07-08 12:46:44,283 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-08 12:46:44,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969550902] [2020-07-08 12:46:44,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:44,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:44,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452948842] [2020-07-08 12:46:44,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 12:46:44,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:44,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:44,307 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-08 12:46:44,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:44,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:44,308 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2020-07-08 12:46:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:44,657 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-07-08 12:46:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:44,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 12:46:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2020-07-08 12:46:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2020-07-08 12:46:44,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2020-07-08 12:46:44,770 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-08 12:46:44,773 INFO L225 Difference]: With dead ends: 75 [2020-07-08 12:46:44,773 INFO L226 Difference]: Without dead ends: 73 [2020-07-08 12:46:44,774 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-08 12:46:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-08 12:46:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2020-07-08 12:46:44,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:44,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 56 states. [2020-07-08 12:46:44,820 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 56 states. [2020-07-08 12:46:44,821 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 56 states. [2020-07-08 12:46:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:44,829 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-08 12:46:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-08 12:46:44,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:44,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:44,833 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 73 states. [2020-07-08 12:46:44,833 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 73 states. [2020-07-08 12:46:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:44,842 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-08 12:46:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-08 12:46:44,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:44,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:44,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:44,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 12:46:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-08 12:46:44,851 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2020-07-08 12:46:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:44,852 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-08 12:46:44,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-08 12:46:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 12:46:44,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:44,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:44,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:46:44,854 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-08 12:46:44,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1240184593, now seen corresponding path program 1 times [2020-07-08 12:46:44,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:44,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735796318] [2020-07-08 12:46:44,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:44,927 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-08 12:46:44,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {1163#true} assume true; {1163#true} is VALID [2020-07-08 12:46:44,928 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1163#true} {1163#true} #147#return; {1163#true} is VALID [2020-07-08 12:46:44,929 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-08 12:46:44,930 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-08 12:46:44,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {1163#true} assume true; {1163#true} is VALID [2020-07-08 12:46:44,930 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1163#true} {1163#true} #147#return; {1163#true} is VALID [2020-07-08 12:46:44,930 INFO L263 TraceCheckUtils]: 4: Hoare triple {1163#true} call #t~ret3 := main(); {1163#true} is VALID [2020-07-08 12:46:44,931 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-08 12:46:44,932 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-08 12:46:44,932 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-08 12:46:44,933 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-08 12:46:44,934 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-08 12:46:44,934 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-08 12:46:44,935 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-08 12:46:44,936 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-08 12:46:44,936 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-08 12:46:44,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {1164#false} assume !false; {1164#false} is VALID [2020-07-08 12:46:44,937 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-08 12:46:44,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735796318] [2020-07-08 12:46:44,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:44,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:44,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421416696] [2020-07-08 12:46:44,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:46:44,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:44,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:44,954 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-08 12:46:44,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:44,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:44,956 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-07-08 12:46:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:45,373 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2020-07-08 12:46:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:45,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:46:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2020-07-08 12:46:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2020-07-08 12:46:45,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2020-07-08 12:46:45,536 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-08 12:46:45,539 INFO L225 Difference]: With dead ends: 96 [2020-07-08 12:46:45,540 INFO L226 Difference]: Without dead ends: 94 [2020-07-08 12:46:45,541 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-08 12:46:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-08 12:46:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2020-07-08 12:46:45,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:45,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 54 states. [2020-07-08 12:46:45,584 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 54 states. [2020-07-08 12:46:45,584 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 54 states. [2020-07-08 12:46:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:45,589 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2020-07-08 12:46:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-08 12:46:45,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:45,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:45,593 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 94 states. [2020-07-08 12:46:45,593 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 94 states. [2020-07-08 12:46:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:45,600 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2020-07-08 12:46:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-07-08 12:46:45,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:45,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:45,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:45,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 12:46:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-07-08 12:46:45,604 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2020-07-08 12:46:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:45,605 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-07-08 12:46:45,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-08 12:46:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:46:45,605 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:45,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:45,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:46:45,606 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-08 12:46:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash 208986383, now seen corresponding path program 1 times [2020-07-08 12:46:45,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:45,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73310141] [2020-07-08 12:46:45,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:45,740 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-08 12:46:45,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-08 12:46:45,741 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1535#true} {1535#true} #147#return; {1535#true} is VALID [2020-07-08 12:46:45,742 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-08 12:46:45,742 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-08 12:46:45,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-08 12:46:45,742 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #147#return; {1535#true} is VALID [2020-07-08 12:46:45,742 INFO L263 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret3 := main(); {1535#true} is VALID [2020-07-08 12:46:45,743 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-08 12:46:45,743 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-08 12:46:45,744 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-08 12:46:45,746 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-08 12:46:45,747 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-08 12:46:45,748 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-08 12:46:45,749 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-08 12:46:45,752 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-08 12:46:45,753 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-08 12:46:45,754 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-08 12:46:45,755 INFO L280 TraceCheckUtils]: 15: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2020-07-08 12:46:45,756 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-08 12:46:45,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73310141] [2020-07-08 12:46:45,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:45,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:45,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747010927] [2020-07-08 12:46:45,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:46:45,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:45,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:45,776 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-08 12:46:45,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:45,779 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2020-07-08 12:46:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:46,393 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-07-08 12:46:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:46,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:46:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-08 12:46:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-08 12:46:46,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2020-07-08 12:46:46,558 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-08 12:46:46,560 INFO L225 Difference]: With dead ends: 95 [2020-07-08 12:46:46,560 INFO L226 Difference]: Without dead ends: 93 [2020-07-08 12:46:46,561 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-08 12:46:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-08 12:46:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2020-07-08 12:46:46,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:46,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 52 states. [2020-07-08 12:46:46,594 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 52 states. [2020-07-08 12:46:46,594 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 52 states. [2020-07-08 12:46:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:46,598 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-08 12:46:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-07-08 12:46:46,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:46,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:46,599 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 93 states. [2020-07-08 12:46:46,599 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 93 states. [2020-07-08 12:46:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:46,605 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-08 12:46:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-07-08 12:46:46,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:46,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:46,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:46,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 12:46:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-07-08 12:46:46,608 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2020-07-08 12:46:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:46,608 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-07-08 12:46:46,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-08 12:46:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:46:46,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:46,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:46,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:46:46,609 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-08 12:46:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1458792136, now seen corresponding path program 1 times [2020-07-08 12:46:46,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:46,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582273900] [2020-07-08 12:46:46,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:46,680 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-08 12:46:46,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-08 12:46:46,681 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #147#return; {1907#true} is VALID [2020-07-08 12:46:46,682 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-08 12:46:46,682 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-08 12:46:46,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-08 12:46:46,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #147#return; {1907#true} is VALID [2020-07-08 12:46:46,683 INFO L263 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret3 := main(); {1907#true} is VALID [2020-07-08 12:46:46,683 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-08 12:46:46,683 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-08 12:46:46,684 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-08 12:46:46,684 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-08 12:46:46,685 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-08 12:46:46,685 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-08 12:46:46,686 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-08 12:46:46,686 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-08 12:46:46,688 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-08 12:46:46,690 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-08 12:46:46,690 INFO L280 TraceCheckUtils]: 15: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2020-07-08 12:46:46,691 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-08 12:46:46,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582273900] [2020-07-08 12:46:46,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:46,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:46,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195489516] [2020-07-08 12:46:46,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:46:46,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:46,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:46,715 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-08 12:46:46,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:46,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:46,717 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2020-07-08 12:46:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:47,141 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-08 12:46:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:47,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:46:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-08 12:46:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-08 12:46:47,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-08 12:46:47,258 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-08 12:46:47,260 INFO L225 Difference]: With dead ends: 69 [2020-07-08 12:46:47,261 INFO L226 Difference]: Without dead ends: 67 [2020-07-08 12:46:47,262 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-08 12:46:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-08 12:46:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2020-07-08 12:46:47,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:47,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 50 states. [2020-07-08 12:46:47,298 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 50 states. [2020-07-08 12:46:47,298 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 50 states. [2020-07-08 12:46:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:47,301 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-08 12:46:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-08 12:46:47,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:47,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:47,302 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 67 states. [2020-07-08 12:46:47,302 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 67 states. [2020-07-08 12:46:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:47,305 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-08 12:46:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-08 12:46:47,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:47,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:47,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:47,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-08 12:46:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-08 12:46:47,308 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2020-07-08 12:46:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:47,308 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-08 12:46:47,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-08 12:46:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:46:47,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:47,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:47,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:46:47,310 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-08 12:46:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2111353611, now seen corresponding path program 1 times [2020-07-08 12:46:47,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:47,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835606082] [2020-07-08 12:46:47,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:47,405 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-08 12:46:47,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {2198#true} assume true; {2198#true} is VALID [2020-07-08 12:46:47,406 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2198#true} {2198#true} #147#return; {2198#true} is VALID [2020-07-08 12:46:47,407 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-08 12:46:47,407 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-08 12:46:47,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2020-07-08 12:46:47,408 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #147#return; {2198#true} is VALID [2020-07-08 12:46:47,408 INFO L263 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret3 := main(); {2198#true} is VALID [2020-07-08 12:46:47,408 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-08 12:46:47,409 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-08 12:46:47,410 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-08 12:46:47,411 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-08 12:46:47,412 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-08 12:46:47,413 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-08 12:46:47,414 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-08 12:46:47,414 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-08 12:46:47,418 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-08 12:46:47,419 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-08 12:46:47,421 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-08 12:46:47,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2020-07-08 12:46:47,422 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-08 12:46:47,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835606082] [2020-07-08 12:46:47,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:47,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:47,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105361104] [2020-07-08 12:46:47,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-08 12:46:47,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:47,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:47,445 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-08 12:46:47,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:47,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:47,447 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2020-07-08 12:46:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:47,864 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2020-07-08 12:46:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:47,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-08 12:46:47,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-08 12:46:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-08 12:46:47,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2020-07-08 12:46:47,995 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-08 12:46:47,997 INFO L225 Difference]: With dead ends: 91 [2020-07-08 12:46:47,998 INFO L226 Difference]: Without dead ends: 89 [2020-07-08 12:46:47,998 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-08 12:46:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-08 12:46:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2020-07-08 12:46:48,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:48,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 48 states. [2020-07-08 12:46:48,038 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 48 states. [2020-07-08 12:46:48,039 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 48 states. [2020-07-08 12:46:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:48,043 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2020-07-08 12:46:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-08 12:46:48,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:48,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:48,043 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 89 states. [2020-07-08 12:46:48,044 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 89 states. [2020-07-08 12:46:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:48,046 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2020-07-08 12:46:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-07-08 12:46:48,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:48,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:48,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:48,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-08 12:46:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-08 12:46:48,049 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2020-07-08 12:46:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:48,049 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-08 12:46:48,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-08 12:46:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:46:48,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:48,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:48,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:46:48,051 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-08 12:46:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:48,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2022080917, now seen corresponding path program 1 times [2020-07-08 12:46:48,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:48,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591616518] [2020-07-08 12:46:48,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:48,200 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-08 12:46:48,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-08 12:46:48,201 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #147#return; {2550#true} is VALID [2020-07-08 12:46:48,204 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-08 12:46:48,204 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-08 12:46:48,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-08 12:46:48,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #147#return; {2550#true} is VALID [2020-07-08 12:46:48,205 INFO L263 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret3 := main(); {2550#true} is VALID [2020-07-08 12:46:48,205 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-08 12:46:48,206 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-08 12:46:48,206 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-08 12:46:48,206 INFO L280 TraceCheckUtils]: 8: Hoare triple {2550#true} assume ~main__i~0 < ~main__len~0; {2550#true} is VALID [2020-07-08 12:46:48,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {2550#true} assume ~main__j~0 < ~main__limit~0; {2550#true} is VALID [2020-07-08 12:46:48,206 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-08 12:46:48,207 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-08 12:46:48,208 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-08 12:46:48,209 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-08 12:46:48,210 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-08 12:46:48,211 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-08 12:46:48,211 INFO L280 TraceCheckUtils]: 16: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2020-07-08 12:46:48,212 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-08 12:46:48,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591616518] [2020-07-08 12:46:48,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:48,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:48,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373635791] [2020-07-08 12:46:48,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-08 12:46:48,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:48,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:48,238 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-08 12:46:48,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:48,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:48,239 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2020-07-08 12:46:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:48,770 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-08 12:46:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:48,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-08 12:46:48,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2020-07-08 12:46:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2020-07-08 12:46:48,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2020-07-08 12:46:48,891 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-08 12:46:48,892 INFO L225 Difference]: With dead ends: 73 [2020-07-08 12:46:48,893 INFO L226 Difference]: Without dead ends: 71 [2020-07-08 12:46:48,893 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-08 12:46:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-08 12:46:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-07-08 12:46:48,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:48,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 46 states. [2020-07-08 12:46:48,936 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 46 states. [2020-07-08 12:46:48,936 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 46 states. [2020-07-08 12:46:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:48,939 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-07-08 12:46:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-08 12:46:48,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:48,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:48,940 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 71 states. [2020-07-08 12:46:48,940 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 71 states. [2020-07-08 12:46:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:48,942 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-07-08 12:46:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-08 12:46:48,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:48,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:48,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:48,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 12:46:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-08 12:46:48,945 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2020-07-08 12:46:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:48,946 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-08 12:46:48,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-08 12:46:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:46:48,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:48,947 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-08 12:46:48,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 12:46:48,947 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-08 12:46:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1740004142, now seen corresponding path program 1 times [2020-07-08 12:46:48,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:48,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233594285] [2020-07-08 12:46:48,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,035 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-08 12:46:49,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {2855#true} assume true; {2855#true} is VALID [2020-07-08 12:46:49,036 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2855#true} {2855#true} #147#return; {2855#true} is VALID [2020-07-08 12:46:49,037 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-08 12:46:49,037 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-08 12:46:49,037 INFO L280 TraceCheckUtils]: 2: Hoare triple {2855#true} assume true; {2855#true} is VALID [2020-07-08 12:46:49,037 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} #147#return; {2855#true} is VALID [2020-07-08 12:46:49,037 INFO L263 TraceCheckUtils]: 4: Hoare triple {2855#true} call #t~ret3 := main(); {2855#true} is VALID [2020-07-08 12:46:49,038 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-08 12:46:49,039 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-08 12:46:49,039 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-08 12:46:49,040 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-08 12:46:49,040 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-08 12:46:49,041 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-08 12:46:49,042 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-08 12:46:49,042 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-08 12:46:49,042 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-08 12:46:49,043 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-08 12:46:49,044 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-08 12:46:49,044 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-08 12:46:49,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {2856#false} assume !false; {2856#false} is VALID [2020-07-08 12:46:49,045 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-08 12:46:49,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233594285] [2020-07-08 12:46:49,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:49,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:49,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908530883] [2020-07-08 12:46:49,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 12:46:49,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:49,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:49,074 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-08 12:46:49,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:49,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:49,076 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2020-07-08 12:46:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:49,522 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-07-08 12:46:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:49,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 12:46:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-08 12:46:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-08 12:46:49,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2020-07-08 12:46:49,637 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-08 12:46:49,638 INFO L225 Difference]: With dead ends: 61 [2020-07-08 12:46:49,638 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 12:46:49,640 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-08 12:46:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 12:46:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2020-07-08 12:46:49,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:49,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 44 states. [2020-07-08 12:46:49,687 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 44 states. [2020-07-08 12:46:49,688 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 44 states. [2020-07-08 12:46:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:49,691 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-08 12:46:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-08 12:46:49,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:49,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:49,693 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 59 states. [2020-07-08 12:46:49,693 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 59 states. [2020-07-08 12:46:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:49,695 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-08 12:46:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-08 12:46:49,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:49,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:49,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:49,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 12:46:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-07-08 12:46:49,698 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2020-07-08 12:46:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:49,699 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-07-08 12:46:49,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-08 12:46:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:46:49,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:49,700 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-08 12:46:49,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 12:46:49,701 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-08 12:46:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1894443311, now seen corresponding path program 1 times [2020-07-08 12:46:49,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:49,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184045827] [2020-07-08 12:46:49,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,817 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-08 12:46:49,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {3117#true} assume true; {3117#true} is VALID [2020-07-08 12:46:49,818 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3117#true} {3117#true} #147#return; {3117#true} is VALID [2020-07-08 12:46:49,819 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-08 12:46:49,819 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-08 12:46:49,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {3117#true} assume true; {3117#true} is VALID [2020-07-08 12:46:49,820 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3117#true} {3117#true} #147#return; {3117#true} is VALID [2020-07-08 12:46:49,820 INFO L263 TraceCheckUtils]: 4: Hoare triple {3117#true} call #t~ret3 := main(); {3117#true} is VALID [2020-07-08 12:46:49,820 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-08 12:46:49,821 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-08 12:46:49,821 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-08 12:46:49,822 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-08 12:46:49,824 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-08 12:46:49,825 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-08 12:46:49,826 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-08 12:46:49,826 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-08 12:46:49,827 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-08 12:46:49,827 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-08 12:46:49,828 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-08 12:46:49,829 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-08 12:46:49,829 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-08 12:46:49,830 INFO L280 TraceCheckUtils]: 18: Hoare triple {3118#false} assume !false; {3118#false} is VALID [2020-07-08 12:46:49,830 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-08 12:46:49,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184045827] [2020-07-08 12:46:49,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:49,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:49,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738901815] [2020-07-08 12:46:49,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 12:46:49,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:49,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:49,857 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-08 12:46:49,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:49,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:49,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:49,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:49,858 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2020-07-08 12:46:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:50,173 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-07-08 12:46:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:46:50,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 12:46:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-08 12:46:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-08 12:46:50,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-08 12:46:50,270 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-08 12:46:50,272 INFO L225 Difference]: With dead ends: 61 [2020-07-08 12:46:50,272 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 12:46:50,273 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-08 12:46:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 12:46:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-07-08 12:46:50,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:50,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 42 states. [2020-07-08 12:46:50,315 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 42 states. [2020-07-08 12:46:50,315 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 42 states. [2020-07-08 12:46:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:50,317 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-08 12:46:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-08 12:46:50,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:50,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:50,318 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 59 states. [2020-07-08 12:46:50,318 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 59 states. [2020-07-08 12:46:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:50,319 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-08 12:46:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-08 12:46:50,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:50,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:50,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:50,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 12:46:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-07-08 12:46:50,321 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2020-07-08 12:46:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:50,321 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-07-08 12:46:50,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-08 12:46:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:46:50,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:50,321 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-08 12:46:50,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 12:46:50,322 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-08 12:46:50,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1401802644, now seen corresponding path program 1 times [2020-07-08 12:46:50,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:50,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488864197] [2020-07-08 12:46:50,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,394 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-08 12:46:50,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {3373#true} assume true; {3373#true} is VALID [2020-07-08 12:46:50,395 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3373#true} {3373#true} #147#return; {3373#true} is VALID [2020-07-08 12:46:50,396 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-08 12:46:50,396 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-08 12:46:50,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {3373#true} assume true; {3373#true} is VALID [2020-07-08 12:46:50,397 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3373#true} {3373#true} #147#return; {3373#true} is VALID [2020-07-08 12:46:50,397 INFO L263 TraceCheckUtils]: 4: Hoare triple {3373#true} call #t~ret3 := main(); {3373#true} is VALID [2020-07-08 12:46:50,397 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-08 12:46:50,397 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-08 12:46:50,397 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-08 12:46:50,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {3373#true} assume ~main__i~0 < ~main__len~0; {3373#true} is VALID [2020-07-08 12:46:50,398 INFO L280 TraceCheckUtils]: 9: Hoare triple {3373#true} assume ~main__j~0 < ~main__limit~0; {3373#true} is VALID [2020-07-08 12:46:50,399 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-08 12:46:50,404 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-08 12:46:50,405 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-08 12:46:50,405 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-08 12:46:50,406 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-08 12:46:50,406 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-08 12:46:50,406 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-08 12:46:50,407 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-08 12:46:50,408 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-08 12:46:50,408 INFO L280 TraceCheckUtils]: 19: Hoare triple {3374#false} assume !false; {3374#false} is VALID [2020-07-08 12:46:50,409 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-08 12:46:50,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488864197] [2020-07-08 12:46:50,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:50,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:50,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679819710] [2020-07-08 12:46:50,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 12:46:50,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:50,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:50,433 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-08 12:46:50,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:50,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:50,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:50,434 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-07-08 12:46:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:50,872 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-08 12:46:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:50,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 12:46:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-08 12:46:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-08 12:46:50,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2020-07-08 12:46:50,988 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-08 12:46:50,990 INFO L225 Difference]: With dead ends: 69 [2020-07-08 12:46:50,990 INFO L226 Difference]: Without dead ends: 67 [2020-07-08 12:46:50,990 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-08 12:46:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-08 12:46:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2020-07-08 12:46:51,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:51,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 40 states. [2020-07-08 12:46:51,038 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 40 states. [2020-07-08 12:46:51,039 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 40 states. [2020-07-08 12:46:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,042 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-08 12:46:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-08 12:46:51,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:51,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:51,043 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 67 states. [2020-07-08 12:46:51,043 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 67 states. [2020-07-08 12:46:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,045 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-08 12:46:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-08 12:46:51,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:51,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:51,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:51,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 12:46:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-08 12:46:51,047 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2020-07-08 12:46:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:51,047 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-08 12:46:51,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 12:46:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:46:51,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:51,048 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-08 12:46:51,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 12:46:51,049 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-08 12:46:51,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:51,049 INFO L82 PathProgramCache]: Analyzing trace with hash 506212151, now seen corresponding path program 1 times [2020-07-08 12:46:51,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:51,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117539048] [2020-07-08 12:46:51,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,117 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-08 12:46:51,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {3655#true} assume true; {3655#true} is VALID [2020-07-08 12:46:51,118 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3655#true} {3655#true} #147#return; {3655#true} is VALID [2020-07-08 12:46:51,119 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-08 12:46:51,119 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-08 12:46:51,120 INFO L280 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2020-07-08 12:46:51,120 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #147#return; {3655#true} is VALID [2020-07-08 12:46:51,120 INFO L263 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret3 := main(); {3655#true} is VALID [2020-07-08 12:46:51,120 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-08 12:46:51,121 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-08 12:46:51,122 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-08 12:46:51,123 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-08 12:46:51,123 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-08 12:46:51,124 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-08 12:46:51,124 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-08 12:46:51,125 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-08 12:46:51,126 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-08 12:46:51,126 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-08 12:46:51,127 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-08 12:46:51,130 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-08 12:46:51,135 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-08 12:46:51,136 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-08 12:46:51,137 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-08 12:46:51,137 INFO L280 TraceCheckUtils]: 20: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2020-07-08 12:46:51,138 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-08 12:46:51,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117539048] [2020-07-08 12:46:51,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:51,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:51,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101126891] [2020-07-08 12:46:51,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-08 12:46:51,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:51,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:51,164 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-08 12:46:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:51,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:51,166 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2020-07-08 12:46:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,702 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-07-08 12:46:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:51,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-08 12:46:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-08 12:46:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2020-07-08 12:46:51,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2020-07-08 12:46:51,828 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-08 12:46:51,830 INFO L225 Difference]: With dead ends: 74 [2020-07-08 12:46:51,830 INFO L226 Difference]: Without dead ends: 72 [2020-07-08 12:46:51,831 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-08 12:46:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-08 12:46:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2020-07-08 12:46:51,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:51,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 38 states. [2020-07-08 12:46:51,904 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 38 states. [2020-07-08 12:46:51,904 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 38 states. [2020-07-08 12:46:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,906 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-08 12:46:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-08 12:46:51,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:51,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:51,907 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 72 states. [2020-07-08 12:46:51,907 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 72 states. [2020-07-08 12:46:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,910 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-08 12:46:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-08 12:46:51,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:51,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:51,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:51,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 12:46:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-07-08 12:46:51,913 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2020-07-08 12:46:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:51,913 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-07-08 12:46:51,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-08 12:46:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:46:51,914 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:51,914 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-08 12:46:51,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 12:46:51,915 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-08 12:46:51,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1487289350, now seen corresponding path program 1 times [2020-07-08 12:46:51,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:51,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210047903] [2020-07-08 12:46:51,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,026 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-08 12:46:52,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {3951#true} assume true; {3951#true} is VALID [2020-07-08 12:46:52,027 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3951#true} {3951#true} #147#return; {3951#true} is VALID [2020-07-08 12:46:52,028 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-08 12:46:52,028 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-08 12:46:52,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {3951#true} assume true; {3951#true} is VALID [2020-07-08 12:46:52,029 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3951#true} {3951#true} #147#return; {3951#true} is VALID [2020-07-08 12:46:52,029 INFO L263 TraceCheckUtils]: 4: Hoare triple {3951#true} call #t~ret3 := main(); {3951#true} is VALID [2020-07-08 12:46:52,029 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-08 12:46:52,030 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-08 12:46:52,034 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-08 12:46:52,035 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-08 12:46:52,036 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-08 12:46:52,036 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-08 12:46:52,037 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-08 12:46:52,039 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-08 12:46:52,040 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-08 12:46:52,040 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-08 12:46:52,042 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-08 12:46:52,043 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-08 12:46:52,045 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-08 12:46:52,046 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-08 12:46:52,047 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-08 12:46:52,048 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-08 12:46:52,049 INFO L280 TraceCheckUtils]: 21: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2020-07-08 12:46:52,050 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-08 12:46:52,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210047903] [2020-07-08 12:46:52,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:52,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:46:52,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235596998] [2020-07-08 12:46:52,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-08 12:46:52,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:52,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:46:52,083 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-08 12:46:52,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:46:52,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:46:52,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:52,084 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2020-07-08 12:46:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:52,751 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-07-08 12:46:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:46:52,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-08 12:46:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-08 12:46:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2020-07-08 12:46:52,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2020-07-08 12:46:52,866 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-08 12:46:52,867 INFO L225 Difference]: With dead ends: 62 [2020-07-08 12:46:52,867 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 12:46:52,868 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-08 12:46:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 12:46:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2020-07-08 12:46:52,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:52,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 36 states. [2020-07-08 12:46:52,923 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 36 states. [2020-07-08 12:46:52,923 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 36 states. [2020-07-08 12:46:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:52,925 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-08 12:46:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-07-08 12:46:52,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:52,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:52,926 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 60 states. [2020-07-08 12:46:52,926 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 60 states. [2020-07-08 12:46:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:52,928 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-08 12:46:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-07-08 12:46:52,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:52,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:52,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:52,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:46:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-07-08 12:46:52,930 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2020-07-08 12:46:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:52,930 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-07-08 12:46:52,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:46:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-08 12:46:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:46:52,931 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:52,931 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-08 12:46:52,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 12:46:52,931 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-08 12:46:52,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:52,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1138673565, now seen corresponding path program 1 times [2020-07-08 12:46:52,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:52,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535196480] [2020-07-08 12:46:52,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,995 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-08 12:46:52,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {4216#true} assume true; {4216#true} is VALID [2020-07-08 12:46:52,997 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4216#true} {4216#true} #147#return; {4216#true} is VALID [2020-07-08 12:46:52,998 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-08 12:46:52,998 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-08 12:46:52,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {4216#true} assume true; {4216#true} is VALID [2020-07-08 12:46:52,998 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4216#true} {4216#true} #147#return; {4216#true} is VALID [2020-07-08 12:46:52,999 INFO L263 TraceCheckUtils]: 4: Hoare triple {4216#true} call #t~ret3 := main(); {4216#true} is VALID [2020-07-08 12:46:52,999 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-08 12:46:52,999 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-08 12:46:53,000 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-08 12:46:53,001 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-08 12:46:53,002 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-08 12:46:53,002 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-08 12:46:53,003 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-08 12:46:53,006 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-08 12:46:53,013 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-08 12:46:53,013 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-08 12:46:53,014 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-08 12:46:53,015 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-08 12:46:53,016 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-08 12:46:53,017 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-08 12:46:53,017 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-08 12:46:53,018 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-08 12:46:53,022 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-08 12:46:53,022 INFO L280 TraceCheckUtils]: 22: Hoare triple {4217#false} assume !false; {4217#false} is VALID [2020-07-08 12:46:53,023 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-08 12:46:53,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535196480] [2020-07-08 12:46:53,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:53,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:53,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252294851] [2020-07-08 12:46:53,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-08 12:46:53,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:53,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:53,052 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-08 12:46:53,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:53,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:53,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:53,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:53,053 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2020-07-08 12:46:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:53,584 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-07-08 12:46:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:53,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-08 12:46:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-08 12:46:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2020-07-08 12:46:53,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2020-07-08 12:46:53,735 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-08 12:46:53,737 INFO L225 Difference]: With dead ends: 87 [2020-07-08 12:46:53,737 INFO L226 Difference]: Without dead ends: 85 [2020-07-08 12:46:53,738 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-08 12:46:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-08 12:46:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2020-07-08 12:46:53,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:53,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 34 states. [2020-07-08 12:46:53,789 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 34 states. [2020-07-08 12:46:53,789 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 34 states. [2020-07-08 12:46:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:53,791 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2020-07-08 12:46:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-08 12:46:53,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:53,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:53,792 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 85 states. [2020-07-08 12:46:53,792 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 85 states. [2020-07-08 12:46:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:53,794 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2020-07-08 12:46:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-08 12:46:53,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:53,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:53,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:53,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 12:46:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-08 12:46:53,797 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2020-07-08 12:46:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:53,797 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-08 12:46:53,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-08 12:46:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:46:53,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:53,798 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-08 12:46:53,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 12:46:53,799 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-08 12:46:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash 939145312, now seen corresponding path program 1 times [2020-07-08 12:46:53,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:53,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730872038] [2020-07-08 12:46:53,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,893 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-08 12:46:53,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {4551#true} assume true; {4551#true} is VALID [2020-07-08 12:46:53,894 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4551#true} {4551#true} #147#return; {4551#true} is VALID [2020-07-08 12:46:53,895 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-08 12:46:53,895 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-08 12:46:53,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {4551#true} assume true; {4551#true} is VALID [2020-07-08 12:46:53,896 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4551#true} {4551#true} #147#return; {4551#true} is VALID [2020-07-08 12:46:53,896 INFO L263 TraceCheckUtils]: 4: Hoare triple {4551#true} call #t~ret3 := main(); {4551#true} is VALID [2020-07-08 12:46:53,896 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-08 12:46:53,897 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-08 12:46:53,898 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-08 12:46:53,899 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-08 12:46:53,899 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-08 12:46:53,900 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-08 12:46:53,901 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-08 12:46:53,901 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-08 12:46:53,902 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-08 12:46:53,902 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-08 12:46:53,903 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-08 12:46:53,905 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-08 12:46:53,906 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-08 12:46:53,907 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-08 12:46:53,907 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-08 12:46:53,908 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-08 12:46:53,909 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-08 12:46:53,910 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-08 12:46:53,910 INFO L280 TraceCheckUtils]: 23: Hoare triple {4552#false} assume !false; {4552#false} is VALID [2020-07-08 12:46:53,911 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-08 12:46:53,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730872038] [2020-07-08 12:46:53,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:53,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:46:53,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731452960] [2020-07-08 12:46:53,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 12:46:53,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:53,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:46:53,942 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-08 12:46:53,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:46:53,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:46:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:53,943 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2020-07-08 12:46:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:54,549 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-07-08 12:46:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:46:54,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 12:46:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-08 12:46:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2020-07-08 12:46:54,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2020-07-08 12:46:54,661 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-08 12:46:54,663 INFO L225 Difference]: With dead ends: 60 [2020-07-08 12:46:54,663 INFO L226 Difference]: Without dead ends: 58 [2020-07-08 12:46:54,663 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-08 12:46:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-08 12:46:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2020-07-08 12:46:54,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:54,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 32 states. [2020-07-08 12:46:54,740 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 32 states. [2020-07-08 12:46:54,741 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 32 states. [2020-07-08 12:46:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:54,742 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-07-08 12:46:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-08 12:46:54,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:54,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:54,743 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 58 states. [2020-07-08 12:46:54,744 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 58 states. [2020-07-08 12:46:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:54,745 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-07-08 12:46:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-08 12:46:54,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:54,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:54,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:54,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:46:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-08 12:46:54,747 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2020-07-08 12:46:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:54,748 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-08 12:46:54,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:46:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 12:46:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:46:54,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:54,750 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-08 12:46:54,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 12:46:54,752 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-08 12:46:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash -951263229, now seen corresponding path program 1 times [2020-07-08 12:46:54,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:54,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376872601] [2020-07-08 12:46:54,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,865 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-08 12:46:54,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {4806#true} assume true; {4806#true} is VALID [2020-07-08 12:46:54,865 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4806#true} {4806#true} #147#return; {4806#true} is VALID [2020-07-08 12:46:54,867 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-08 12:46:54,868 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-08 12:46:54,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2020-07-08 12:46:54,868 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #147#return; {4806#true} is VALID [2020-07-08 12:46:54,868 INFO L263 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret3 := main(); {4806#true} is VALID [2020-07-08 12:46:54,869 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-08 12:46:54,869 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-08 12:46:54,869 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-08 12:46:54,870 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-08 12:46:54,870 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-08 12:46:54,871 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-08 12:46:54,871 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-08 12:46:54,872 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-08 12:46:54,873 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-08 12:46:54,873 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-08 12:46:54,874 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-08 12:46:54,874 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-08 12:46:54,875 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-08 12:46:54,876 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-08 12:46:54,876 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-08 12:46:54,877 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-08 12:46:54,878 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-08 12:46:54,879 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-08 12:46:54,879 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-08 12:46:54,879 INFO L280 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2020-07-08 12:46:54,880 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-08 12:46:54,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376872601] [2020-07-08 12:46:54,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:54,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:46:54,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114483372] [2020-07-08 12:46:54,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-08 12:46:54,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:54,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:46:54,913 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-08 12:46:54,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:46:54,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:54,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:46:54,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:54,914 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2020-07-08 12:46:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:55,783 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2020-07-08 12:46:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:46:55,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-08 12:46:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2020-07-08 12:46:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2020-07-08 12:46:55,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2020-07-08 12:46:55,979 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-08 12:46:55,979 INFO L225 Difference]: With dead ends: 125 [2020-07-08 12:46:55,979 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:46:55,980 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-08 12:46:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:46:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:46:55,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:55,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:55,982 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:55,982 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:55,982 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:55,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:55,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:55,983 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:55,983 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:55,983 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:55,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:55,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:55,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:55,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:46:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:46:55,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-08 12:46:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:55,985 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:46:55,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:46:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:55,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:55,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 12:46:55,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:46:56,333 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 92 [2020-07-08 12:46:56,553 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 72 [2020-07-08 12:46:56,779 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 48 [2020-07-08 12:46:57,013 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 39 [2020-07-08 12:46:57,194 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 23 [2020-07-08 12:46:57,298 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:57,299 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-08 12:46:57,299 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:57,299 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:57,299 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:46:57,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:46:57,299 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:57,300 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-08 12:46:57,300 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 12:46:57,300 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-08 12:46:57,300 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-08 12:46:57,300 INFO L268 CegarLoopResult]: For program point L225(lines 225 267) no Hoare annotation was computed. [2020-07-08 12:46:57,300 INFO L268 CegarLoopResult]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 86) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 311) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point L201(lines 201 271) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point L36(lines 36 292) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2020-07-08 12:46:57,301 INFO L268 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-07-08 12:46:57,302 INFO L268 CegarLoopResult]: For program point L243(line 243) no Hoare annotation was computed. [2020-07-08 12:46:57,302 INFO L268 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2020-07-08 12:46:57,302 INFO L268 CegarLoopResult]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2020-07-08 12:46:57,302 INFO L268 CegarLoopResult]: For program point L227(line 227) no Hoare annotation was computed. [2020-07-08 12:46:57,302 INFO L268 CegarLoopResult]: For program point L161(lines 161 277) no Hoare annotation was computed. [2020-07-08 12:46:57,302 INFO L268 CegarLoopResult]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2020-07-08 12:46:57,302 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-08 12:46:57,302 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 311) no Hoare annotation was computed. [2020-07-08 12:46:57,303 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-08 12:46:57,303 INFO L268 CegarLoopResult]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2020-07-08 12:46:57,303 INFO L268 CegarLoopResult]: For program point L137(lines 137 281) no Hoare annotation was computed. [2020-07-08 12:46:57,303 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2020-07-08 12:46:57,303 INFO L268 CegarLoopResult]: For program point L96(lines 96 123) no Hoare annotation was computed. [2020-07-08 12:46:57,303 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 311) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2020-07-08 12:46:57,303 INFO L268 CegarLoopResult]: For program point L253(lines 253 263) no Hoare annotation was computed. [2020-07-08 12:46:57,304 INFO L268 CegarLoopResult]: For program point L55(lines 55 284) no Hoare annotation was computed. [2020-07-08 12:46:57,304 INFO L268 CegarLoopResult]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2020-07-08 12:46:57,304 INFO L268 CegarLoopResult]: For program point L72(lines 72 127) no Hoare annotation was computed. [2020-07-08 12:46:57,304 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-08 12:46:57,304 INFO L268 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2020-07-08 12:46:57,304 INFO L268 CegarLoopResult]: For program point L64(lines 64 283) no Hoare annotation was computed. [2020-07-08 12:46:57,305 INFO L268 CegarLoopResult]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2020-07-08 12:46:57,305 INFO L268 CegarLoopResult]: For program point L213(lines 213 269) no Hoare annotation was computed. [2020-07-08 12:46:57,305 INFO L268 CegarLoopResult]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2020-07-08 12:46:57,305 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-07-08 12:46:57,305 INFO L268 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-07-08 12:46:57,305 INFO L268 CegarLoopResult]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2020-07-08 12:46:57,305 INFO L268 CegarLoopResult]: For program point L255(line 255) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point L189(lines 189 273) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point L173(lines 173 275) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 57) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point L215(line 215) no Hoare annotation was computed. [2020-07-08 12:46:57,306 INFO L268 CegarLoopResult]: For program point L149(lines 149 279) no Hoare annotation was computed. [2020-07-08 12:46:57,307 INFO L268 CegarLoopResult]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-07-08 12:46:57,307 INFO L268 CegarLoopResult]: For program point L108(lines 108 121) no Hoare annotation was computed. [2020-07-08 12:46:57,307 INFO L268 CegarLoopResult]: For program point L34(lines 34 298) no Hoare annotation was computed. [2020-07-08 12:46:57,307 INFO L268 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-07-08 12:46:57,307 INFO L268 CegarLoopResult]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2020-07-08 12:46:57,307 INFO L268 CegarLoopResult]: For program point L84(lines 84 125) no Hoare annotation was computed. [2020-07-08 12:46:57,307 INFO L268 CegarLoopResult]: For program point L18(lines 18 310) no Hoare annotation was computed. [2020-07-08 12:46:57,308 INFO L268 CegarLoopResult]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2020-07-08 12:46:57,308 INFO L268 CegarLoopResult]: For program point L241(lines 241 265) no Hoare annotation was computed. [2020-07-08 12:46:57,308 INFO L268 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2020-07-08 12:46:57,308 INFO L268 CegarLoopResult]: For program point L43(lines 43 286) no Hoare annotation was computed. [2020-07-08 12:46:57,308 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-08 12:46:57,314 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:57,315 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:46:57,315 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:46:57,315 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:57,315 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:57,316 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:57,316 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:57,316 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:46:57,317 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:46:57,317 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:57,317 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:57,317 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-08 12:46:57,317 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:57,318 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:57,319 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:46:57,319 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:46:57,321 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:46:57,321 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:46:57,321 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-08 12:46:57,322 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-08 12:46:57,322 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 12:46:57,322 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 12:46:57,322 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-08 12:46:57,322 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 12:46:57,323 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 12:46:57,323 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-08 12:46:57,323 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-08 12:46:57,323 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-08 12:46:57,323 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-08 12:46:57,323 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-08 12:46:57,324 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-08 12:46:57,325 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2020-07-08 12:46:57,325 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-08 12:46:57,325 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-08 12:46:57,325 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-08 12:46:57,325 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-08 12:46:57,325 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-08 12:46:57,326 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-08 12:46:57,326 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-08 12:46:57,326 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-08 12:46:57,326 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-08 12:46:57,326 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-08 12:46:57,327 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-08 12:46:57,327 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-08 12:46:57,327 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2020-07-08 12:46:57,327 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2020-07-08 12:46:57,327 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2020-07-08 12:46:57,327 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2020-07-08 12:46:57,328 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-08 12:46:57,328 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2020-07-08 12:46:57,328 WARN L170 areAnnotationChecker]: L163 has no Hoare annotation [2020-07-08 12:46:57,328 WARN L170 areAnnotationChecker]: L163 has no Hoare annotation [2020-07-08 12:46:57,328 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-08 12:46:57,329 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-08 12:46:57,329 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-08 12:46:57,329 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-08 12:46:57,329 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-08 12:46:57,329 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-08 12:46:57,330 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2020-07-08 12:46:57,330 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2020-07-08 12:46:57,330 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2020-07-08 12:46:57,330 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2020-07-08 12:46:57,330 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2020-07-08 12:46:57,330 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2020-07-08 12:46:57,331 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2020-07-08 12:46:57,331 WARN L170 areAnnotationChecker]: L213 has no Hoare annotation [2020-07-08 12:46:57,331 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2020-07-08 12:46:57,331 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2020-07-08 12:46:57,331 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2020-07-08 12:46:57,332 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2020-07-08 12:46:57,332 WARN L170 areAnnotationChecker]: L227 has no Hoare annotation [2020-07-08 12:46:57,332 WARN L170 areAnnotationChecker]: L227 has no Hoare annotation [2020-07-08 12:46:57,332 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-08 12:46:57,332 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-08 12:46:57,332 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2020-07-08 12:46:57,333 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2020-07-08 12:46:57,333 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-08 12:46:57,333 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-08 12:46:57,333 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2020-07-08 12:46:57,333 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2020-07-08 12:46:57,334 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-08 12:46:57,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:46:57 BoogieIcfgContainer [2020-07-08 12:46:57,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:46:57,371 INFO L168 Benchmark]: Toolchain (without parser) took 16833.63 ms. Allocated memory was 136.8 MB in the beginning and 390.6 MB in the end (delta: 253.8 MB). Free memory was 101.9 MB in the beginning and 155.5 MB in the end (delta: -53.6 MB). Peak memory consumption was 200.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:57,380 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:46:57,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.47 ms. Allocated memory is still 136.8 MB. Free memory was 101.7 MB in the beginning and 88.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:57,382 INFO L168 Benchmark]: Boogie Preprocessor took 153.54 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 88.6 MB in the beginning and 179.8 MB in the end (delta: -91.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:57,383 INFO L168 Benchmark]: RCFGBuilder took 682.24 ms. Allocated memory is still 201.9 MB. Free memory was 179.8 MB in the beginning and 144.3 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:57,387 INFO L168 Benchmark]: TraceAbstraction took 15643.35 ms. Allocated memory was 201.9 MB in the beginning and 390.6 MB in the end (delta: 188.7 MB). Free memory was 143.6 MB in the beginning and 155.5 MB in the end (delta: -11.9 MB). Peak memory consumption was 176.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:57,392 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.64 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 346.47 ms. Allocated memory is still 136.8 MB. Free memory was 101.7 MB in the beginning and 88.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.54 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 88.6 MB in the beginning and 179.8 MB in the end (delta: -91.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 682.24 ms. Allocated memory is still 201.9 MB. Free memory was 179.8 MB in the beginning and 144.3 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15643.35 ms. Allocated memory was 201.9 MB in the beginning and 390.6 MB in the end (delta: 188.7 MB). Free memory was 143.6 MB in the beginning and 155.5 MB in the end (delta: -11.9 MB). Peak memory consumption was 176.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 255]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 151]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 163]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 227]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 191]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 243]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 215]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 98]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 86]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 57]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((main__i + 1 <= main__len && \old(__return_334) == __return_334) && 0 <= main__j) && main__limit + 4 <= main__bufsize) && 0 <= main__i) || (\old(__return_334) == __return_334 && ((((((main__limit + 4 <= main__bufsize && !(__VERIFIER_assert__cond == 0)) && 1 <= main__i) || ((main__limit + 4 <= main__bufsize && main__j + 4 <= main__bufsize) && 1 <= main__i)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__j) || (((((main__limit + 4 <= main__bufsize && !(__VERIFIER_assert__cond == 0)) && 1 <= main__i) || ((main__limit + 4 <= main__bufsize && main__j + 4 <= main__bufsize) && 1 <= main__i)) && main__j + 4 <= main__bufsize) && 1 <= main__j))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((main__i + 1 <= main__len && \old(__return_334) == __return_334) && 0 <= main__j) && main__limit + 4 <= main__bufsize) && 0 <= main__i) && main__j + 5 <= main__bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (\old(__return_334) == __return_334 && main__limit + 4 <= main__bufsize) && 0 <= main__i - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 69 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 935 SDtfs, 1910 SDslu, 227 SDs, 0 SdLazy, 1420 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 148 HoareAnnotationTreeSize, 7 FomulaSimplifications, 909827071 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 37836 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s 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...