/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_build.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:39:50,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:39:50,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:39:50,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:39:50,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:39:50,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:39:50,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:39:50,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:39:50,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:39:50,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:39:50,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:39:50,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:39:50,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:39:50,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:39:50,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:39:50,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:39:50,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:39:50,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:39:50,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:39:50,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:39:50,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:39:50,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:39:50,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:39:50,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:39:50,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:39:50,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:39:50,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:39:50,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:39:50,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:39:50,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:39:50,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:39:50,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:39:50,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:39:50,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:39:50,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:39:50,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:39:50,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:39:50,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:39:50,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:39:50,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:39:50,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:39:50,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:39:50,692 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:39:50,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:39:50,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:39:50,694 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:39:50,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:39:50,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:39:50,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:39:50,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:39:50,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:39:50,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:39:50,695 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:39:50,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:39:50,695 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:39:50,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:39:50,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:39:50,696 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:39:50,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:39:50,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:39:50,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:39:50,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:39:50,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:39:50,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:39:50,697 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:39:51,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:39:51,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:39:51,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:39:51,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:39:51,021 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:39:51,021 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i [2020-07-08 23:39:51,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56945874/8f467e588b294e8784c9632e9903c677/FLAGfca3bf0d6 [2020-07-08 23:39:51,535 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:39:51,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i [2020-07-08 23:39:51,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56945874/8f467e588b294e8784c9632e9903c677/FLAGfca3bf0d6 [2020-07-08 23:39:51,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56945874/8f467e588b294e8784c9632e9903c677 [2020-07-08 23:39:51,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:39:51,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:39:51,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:39:51,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:39:51,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:39:51,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:39:51" (1/1) ... [2020-07-08 23:39:51,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3e0f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:51, skipping insertion in model container [2020-07-08 23:39:51,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:39:51" (1/1) ... [2020-07-08 23:39:51,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:39:51,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:39:52,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:39:52,127 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:39:52,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:39:52,163 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:39:52,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52 WrapperNode [2020-07-08 23:39:52,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:39:52,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:39:52,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:39:52,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:39:52,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (1/1) ... [2020-07-08 23:39:52,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (1/1) ... [2020-07-08 23:39:52,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (1/1) ... [2020-07-08 23:39:52,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (1/1) ... [2020-07-08 23:39:52,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (1/1) ... [2020-07-08 23:39:52,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (1/1) ... [2020-07-08 23:39:52,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (1/1) ... [2020-07-08 23:39:52,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:39:52,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:39:52,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:39:52,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:39:52,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (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 23:39:52,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:39:52,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:39:52,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:39:52,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:39:52,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:39:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:39:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:39:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:39:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:39:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:39:52,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:39:52,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:39:52,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:39:52,687 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:39:52,688 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 23:39:52,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:39:52 BoogieIcfgContainer [2020-07-08 23:39:52,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:39:52,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:39:52,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:39:52,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:39:52,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:39:51" (1/3) ... [2020-07-08 23:39:52,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d8e1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:39:52, skipping insertion in model container [2020-07-08 23:39:52,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:39:52" (2/3) ... [2020-07-08 23:39:52,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d8e1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:39:52, skipping insertion in model container [2020-07-08 23:39:52,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:39:52" (3/3) ... [2020-07-08 23:39:52,719 INFO L109 eAbstractionObserver]: Analyzing ICFG id_build.i [2020-07-08 23:39:52,729 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:39:52,734 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:39:52,747 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:39:52,769 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:39:52,769 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:39:52,769 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:39:52,769 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:39:52,770 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:39:52,770 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:39:52,770 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:39:52,770 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:39:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-08 23:39:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 23:39:52,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:52,797 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 23:39:52,798 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2141903635, now seen corresponding path program 1 times [2020-07-08 23:39:52,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:52,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [262764849] [2020-07-08 23:39:52,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:53,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 23:39:53,058 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #67#return; {37#true} is VALID [2020-07-08 23:39:53,061 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-08 23:39:53,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 23:39:53,062 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #67#return; {37#true} is VALID [2020-07-08 23:39:53,062 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-08 23:39:53,063 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} havoc ~offset~0; {37#true} is VALID [2020-07-08 23:39:53,063 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~length~0; {37#true} is VALID [2020-07-08 23:39:53,064 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {37#true} is VALID [2020-07-08 23:39:53,064 INFO L280 TraceCheckUtils]: 7: Hoare triple {37#true} ~nlen~0 := #t~nondet0; {37#true} is VALID [2020-07-08 23:39:53,065 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} havoc #t~nondet0; {37#true} is VALID [2020-07-08 23:39:53,065 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} havoc ~i~0; {37#true} is VALID [2020-07-08 23:39:53,066 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#true} havoc ~j~0; {37#true} is VALID [2020-07-08 23:39:53,066 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#true} ~i~0 := 0; {37#true} is VALID [2020-07-08 23:39:53,068 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#true} assume !!(~i~0 < ~nlen~0); {41#(< main_~i~0 main_~nlen~0)} is VALID [2020-07-08 23:39:53,069 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#(< main_~i~0 main_~nlen~0)} ~j~0 := 0; {41#(< main_~i~0 main_~nlen~0)} is VALID [2020-07-08 23:39:53,071 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#(< main_~i~0 main_~nlen~0)} assume !!(~j~0 < 8); {41#(< main_~i~0 main_~nlen~0)} is VALID [2020-07-08 23:39:53,074 INFO L263 TraceCheckUtils]: 15: Hoare triple {41#(< main_~i~0 main_~nlen~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {42#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:39:53,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {42#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {43#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:39:53,078 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {38#false} is VALID [2020-07-08 23:39:53,078 INFO L280 TraceCheckUtils]: 18: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-08 23:39:53,081 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 23:39:53,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [262764849] [2020-07-08 23:39:53,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:39:53,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:39:53,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337102567] [2020-07-08 23:39:53,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 23:39:53,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:53,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:39:53,143 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 23:39:53,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:39:53,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:53,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:39:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:39:53,158 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-08 23:39:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:53,457 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2020-07-08 23:39:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:39:53,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 23:39:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:39:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:39:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-08 23:39:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:39:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-08 23:39:53,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2020-07-08 23:39:53,612 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 23:39:53,642 INFO L225 Difference]: With dead ends: 60 [2020-07-08 23:39:53,642 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 23:39:53,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:39:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 23:39:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-08 23:39:53,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:39:53,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-08 23:39:53,781 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 23:39:53,781 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 23:39:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:53,786 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-08 23:39:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 23:39:53,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:53,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:53,787 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 23:39:53,788 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 23:39:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:53,792 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-08 23:39:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 23:39:53,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:53,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:53,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:39:53,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:39:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 23:39:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-08 23:39:53,799 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 19 [2020-07-08 23:39:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:39:53,799 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-08 23:39:53,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:39:53,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-08 23:39:53,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 23:39:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 23:39:53,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:53,850 INFO L422 BasicCegarLoop]: trace histogram [2, 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 23:39:53,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:39:53,851 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1520201371, now seen corresponding path program 1 times [2020-07-08 23:39:53,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:53,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1672625973] [2020-07-08 23:39:53,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:53,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-08 23:39:53,946 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {300#true} {300#true} #67#return; {300#true} is VALID [2020-07-08 23:39:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:53,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#true} ~cond := #in~cond; {300#true} is VALID [2020-07-08 23:39:53,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#true} assume !(0 == ~cond); {300#true} is VALID [2020-07-08 23:39:53,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-08 23:39:53,960 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {300#true} {304#(< 0 (+ main_~i~0 1))} #71#return; {304#(< 0 (+ main_~i~0 1))} is VALID [2020-07-08 23:39:53,960 INFO L263 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {300#true} is VALID [2020-07-08 23:39:53,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-08 23:39:53,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #67#return; {300#true} is VALID [2020-07-08 23:39:53,962 INFO L263 TraceCheckUtils]: 3: Hoare triple {300#true} call #t~ret3 := main(); {300#true} is VALID [2020-07-08 23:39:53,962 INFO L280 TraceCheckUtils]: 4: Hoare triple {300#true} havoc ~offset~0; {300#true} is VALID [2020-07-08 23:39:53,962 INFO L280 TraceCheckUtils]: 5: Hoare triple {300#true} havoc ~length~0; {300#true} is VALID [2020-07-08 23:39:53,962 INFO L280 TraceCheckUtils]: 6: Hoare triple {300#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {300#true} is VALID [2020-07-08 23:39:53,963 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#true} ~nlen~0 := #t~nondet0; {300#true} is VALID [2020-07-08 23:39:53,963 INFO L280 TraceCheckUtils]: 8: Hoare triple {300#true} havoc #t~nondet0; {300#true} is VALID [2020-07-08 23:39:53,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {300#true} havoc ~i~0; {300#true} is VALID [2020-07-08 23:39:53,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {300#true} havoc ~j~0; {300#true} is VALID [2020-07-08 23:39:53,965 INFO L280 TraceCheckUtils]: 11: Hoare triple {300#true} ~i~0 := 0; {304#(< 0 (+ main_~i~0 1))} is VALID [2020-07-08 23:39:53,966 INFO L280 TraceCheckUtils]: 12: Hoare triple {304#(< 0 (+ main_~i~0 1))} assume !!(~i~0 < ~nlen~0); {304#(< 0 (+ main_~i~0 1))} is VALID [2020-07-08 23:39:53,967 INFO L280 TraceCheckUtils]: 13: Hoare triple {304#(< 0 (+ main_~i~0 1))} ~j~0 := 0; {304#(< 0 (+ main_~i~0 1))} is VALID [2020-07-08 23:39:53,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {304#(< 0 (+ main_~i~0 1))} assume !!(~j~0 < 8); {304#(< 0 (+ main_~i~0 1))} is VALID [2020-07-08 23:39:53,969 INFO L263 TraceCheckUtils]: 15: Hoare triple {304#(< 0 (+ main_~i~0 1))} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {300#true} is VALID [2020-07-08 23:39:53,969 INFO L280 TraceCheckUtils]: 16: Hoare triple {300#true} ~cond := #in~cond; {300#true} is VALID [2020-07-08 23:39:53,969 INFO L280 TraceCheckUtils]: 17: Hoare triple {300#true} assume !(0 == ~cond); {300#true} is VALID [2020-07-08 23:39:53,970 INFO L280 TraceCheckUtils]: 18: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-08 23:39:53,971 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {300#true} {304#(< 0 (+ main_~i~0 1))} #71#return; {304#(< 0 (+ main_~i~0 1))} is VALID [2020-07-08 23:39:53,973 INFO L263 TraceCheckUtils]: 20: Hoare triple {304#(< 0 (+ main_~i~0 1))} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {309#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:39:53,974 INFO L280 TraceCheckUtils]: 21: Hoare triple {309#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {310#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:39:53,975 INFO L280 TraceCheckUtils]: 22: Hoare triple {310#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {301#false} is VALID [2020-07-08 23:39:53,975 INFO L280 TraceCheckUtils]: 23: Hoare triple {301#false} assume !false; {301#false} is VALID [2020-07-08 23:39:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:39:53,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1672625973] [2020-07-08 23:39:53,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:39:53,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:39:53,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806574918] [2020-07-08 23:39:53,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-08 23:39:53,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:53,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:39:54,014 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 23:39:54,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:39:54,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:39:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:39:54,016 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 5 states. [2020-07-08 23:39:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:54,251 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-08 23:39:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:39:54,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-08 23:39:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:39:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:39:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-08 23:39:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:39:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-08 23:39:54,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-08 23:39:54,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:54,327 INFO L225 Difference]: With dead ends: 49 [2020-07-08 23:39:54,328 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 23:39:54,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:39:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 23:39:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-07-08 23:39:54,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:39:54,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2020-07-08 23:39:54,385 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2020-07-08 23:39:54,385 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2020-07-08 23:39:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:54,391 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-08 23:39:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-08 23:39:54,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:54,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:54,392 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2020-07-08 23:39:54,393 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2020-07-08 23:39:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:54,397 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-08 23:39:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-08 23:39:54,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:54,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:54,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:39:54,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:39:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 23:39:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-08 23:39:54,403 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 24 [2020-07-08 23:39:54,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:39:54,404 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-08 23:39:54,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:39:54,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2020-07-08 23:39:54,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-08 23:39:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 23:39:54,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:54,469 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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 23:39:54,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:39:54,469 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1589830701, now seen corresponding path program 1 times [2020-07-08 23:39:54,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:54,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693378337] [2020-07-08 23:39:54,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:54,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-08 23:39:54,513 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {597#true} {597#true} #67#return; {597#true} is VALID [2020-07-08 23:39:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:54,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {597#true} ~cond := #in~cond; {597#true} is VALID [2020-07-08 23:39:54,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {597#true} assume !(0 == ~cond); {597#true} is VALID [2020-07-08 23:39:54,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-08 23:39:54,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {597#true} {598#false} #71#return; {598#false} is VALID [2020-07-08 23:39:54,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2020-07-08 23:39:54,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-08 23:39:54,524 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} #67#return; {597#true} is VALID [2020-07-08 23:39:54,524 INFO L263 TraceCheckUtils]: 3: Hoare triple {597#true} call #t~ret3 := main(); {597#true} is VALID [2020-07-08 23:39:54,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {597#true} havoc ~offset~0; {597#true} is VALID [2020-07-08 23:39:54,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {597#true} havoc ~length~0; {597#true} is VALID [2020-07-08 23:39:54,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {597#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {597#true} is VALID [2020-07-08 23:39:54,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {597#true} ~nlen~0 := #t~nondet0; {597#true} is VALID [2020-07-08 23:39:54,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {597#true} havoc #t~nondet0; {597#true} is VALID [2020-07-08 23:39:54,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {597#true} havoc ~i~0; {597#true} is VALID [2020-07-08 23:39:54,526 INFO L280 TraceCheckUtils]: 10: Hoare triple {597#true} havoc ~j~0; {597#true} is VALID [2020-07-08 23:39:54,527 INFO L280 TraceCheckUtils]: 11: Hoare triple {597#true} ~i~0 := 0; {597#true} is VALID [2020-07-08 23:39:54,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {597#true} assume !!(~i~0 < ~nlen~0); {597#true} is VALID [2020-07-08 23:39:54,528 INFO L280 TraceCheckUtils]: 13: Hoare triple {597#true} ~j~0 := 0; {601#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:54,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {601#(<= main_~j~0 0)} assume !(~j~0 < 8); {598#false} is VALID [2020-07-08 23:39:54,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {598#false} #t~post1 := ~i~0; {598#false} is VALID [2020-07-08 23:39:54,529 INFO L280 TraceCheckUtils]: 16: Hoare triple {598#false} ~i~0 := 1 + #t~post1; {598#false} is VALID [2020-07-08 23:39:54,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {598#false} havoc #t~post1; {598#false} is VALID [2020-07-08 23:39:54,530 INFO L280 TraceCheckUtils]: 18: Hoare triple {598#false} assume !!(~i~0 < ~nlen~0); {598#false} is VALID [2020-07-08 23:39:54,530 INFO L280 TraceCheckUtils]: 19: Hoare triple {598#false} ~j~0 := 0; {598#false} is VALID [2020-07-08 23:39:54,531 INFO L280 TraceCheckUtils]: 20: Hoare triple {598#false} assume !!(~j~0 < 8); {598#false} is VALID [2020-07-08 23:39:54,531 INFO L263 TraceCheckUtils]: 21: Hoare triple {598#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {597#true} is VALID [2020-07-08 23:39:54,531 INFO L280 TraceCheckUtils]: 22: Hoare triple {597#true} ~cond := #in~cond; {597#true} is VALID [2020-07-08 23:39:54,532 INFO L280 TraceCheckUtils]: 23: Hoare triple {597#true} assume !(0 == ~cond); {597#true} is VALID [2020-07-08 23:39:54,532 INFO L280 TraceCheckUtils]: 24: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-08 23:39:54,532 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {597#true} {598#false} #71#return; {598#false} is VALID [2020-07-08 23:39:54,533 INFO L263 TraceCheckUtils]: 26: Hoare triple {598#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {598#false} is VALID [2020-07-08 23:39:54,533 INFO L280 TraceCheckUtils]: 27: Hoare triple {598#false} ~cond := #in~cond; {598#false} is VALID [2020-07-08 23:39:54,533 INFO L280 TraceCheckUtils]: 28: Hoare triple {598#false} assume 0 == ~cond; {598#false} is VALID [2020-07-08 23:39:54,534 INFO L280 TraceCheckUtils]: 29: Hoare triple {598#false} assume !false; {598#false} is VALID [2020-07-08 23:39:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:39:54,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693378337] [2020-07-08 23:39:54,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:39:54,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:39:54,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204613806] [2020-07-08 23:39:54,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 23:39:54,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:54,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:39:54,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:54,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:39:54,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:54,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:39:54,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:39:54,576 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2020-07-08 23:39:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:54,736 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-08 23:39:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:39:54,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 23:39:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:39:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:39:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-08 23:39:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:39:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-08 23:39:54,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-08 23:39:54,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:54,809 INFO L225 Difference]: With dead ends: 76 [2020-07-08 23:39:54,809 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 23:39:54,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:39:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 23:39:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2020-07-08 23:39:54,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:39:54,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 47 states. [2020-07-08 23:39:54,865 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 47 states. [2020-07-08 23:39:54,865 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 47 states. [2020-07-08 23:39:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:54,870 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-08 23:39:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-08 23:39:54,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:54,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:54,872 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 55 states. [2020-07-08 23:39:54,872 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 55 states. [2020-07-08 23:39:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:54,877 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-08 23:39:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-08 23:39:54,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:54,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:54,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:39:54,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:39:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 23:39:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-08 23:39:54,882 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-08 23:39:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:39:54,882 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-08 23:39:54,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:39:54,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-08 23:39:54,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-08 23:39:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 23:39:54,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:54,944 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 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 23:39:54,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:39:54,945 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:54,945 INFO L82 PathProgramCache]: Analyzing trace with hash 156681780, now seen corresponding path program 1 times [2020-07-08 23:39:54,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:54,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1293055861] [2020-07-08 23:39:54,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,012 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {964#true} {964#true} #67#return; {964#true} is VALID [2020-07-08 23:39:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-08 23:39:55,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-08 23:39:55,022 INFO L280 TraceCheckUtils]: 2: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,023 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #71#return; {968#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-08 23:39:55,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-08 23:39:55,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,035 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #73#return; {968#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-08 23:39:55,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-08 23:39:55,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,042 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {964#true} {965#false} #71#return; {965#false} is VALID [2020-07-08 23:39:55,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {964#true} call ULTIMATE.init(); {964#true} is VALID [2020-07-08 23:39:55,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {964#true} {964#true} #67#return; {964#true} is VALID [2020-07-08 23:39:55,043 INFO L263 TraceCheckUtils]: 3: Hoare triple {964#true} call #t~ret3 := main(); {964#true} is VALID [2020-07-08 23:39:55,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {964#true} havoc ~offset~0; {964#true} is VALID [2020-07-08 23:39:55,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {964#true} havoc ~length~0; {964#true} is VALID [2020-07-08 23:39:55,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {964#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {964#true} is VALID [2020-07-08 23:39:55,044 INFO L280 TraceCheckUtils]: 7: Hoare triple {964#true} ~nlen~0 := #t~nondet0; {964#true} is VALID [2020-07-08 23:39:55,044 INFO L280 TraceCheckUtils]: 8: Hoare triple {964#true} havoc #t~nondet0; {964#true} is VALID [2020-07-08 23:39:55,044 INFO L280 TraceCheckUtils]: 9: Hoare triple {964#true} havoc ~i~0; {964#true} is VALID [2020-07-08 23:39:55,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {964#true} havoc ~j~0; {964#true} is VALID [2020-07-08 23:39:55,045 INFO L280 TraceCheckUtils]: 11: Hoare triple {964#true} ~i~0 := 0; {964#true} is VALID [2020-07-08 23:39:55,045 INFO L280 TraceCheckUtils]: 12: Hoare triple {964#true} assume !!(~i~0 < ~nlen~0); {964#true} is VALID [2020-07-08 23:39:55,046 INFO L280 TraceCheckUtils]: 13: Hoare triple {964#true} ~j~0 := 0; {968#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,047 INFO L280 TraceCheckUtils]: 14: Hoare triple {968#(<= main_~j~0 0)} assume !!(~j~0 < 8); {968#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,048 INFO L263 TraceCheckUtils]: 15: Hoare triple {968#(<= main_~j~0 0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {964#true} is VALID [2020-07-08 23:39:55,048 INFO L280 TraceCheckUtils]: 16: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-08 23:39:55,048 INFO L280 TraceCheckUtils]: 17: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-08 23:39:55,048 INFO L280 TraceCheckUtils]: 18: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,050 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #71#return; {968#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,050 INFO L263 TraceCheckUtils]: 20: Hoare triple {968#(<= main_~j~0 0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {964#true} is VALID [2020-07-08 23:39:55,050 INFO L280 TraceCheckUtils]: 21: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-08 23:39:55,050 INFO L280 TraceCheckUtils]: 22: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-08 23:39:55,051 INFO L280 TraceCheckUtils]: 23: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,052 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #73#return; {968#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,052 INFO L280 TraceCheckUtils]: 25: Hoare triple {968#(<= main_~j~0 0)} #t~post2 := ~j~0; {977#(<= |main_#t~post2| 0)} is VALID [2020-07-08 23:39:55,053 INFO L280 TraceCheckUtils]: 26: Hoare triple {977#(<= |main_#t~post2| 0)} ~j~0 := 1 + #t~post2; {978#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,054 INFO L280 TraceCheckUtils]: 27: Hoare triple {978#(<= main_~j~0 1)} havoc #t~post2; {978#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,055 INFO L280 TraceCheckUtils]: 28: Hoare triple {978#(<= main_~j~0 1)} assume !(~j~0 < 8); {965#false} is VALID [2020-07-08 23:39:55,055 INFO L280 TraceCheckUtils]: 29: Hoare triple {965#false} #t~post1 := ~i~0; {965#false} is VALID [2020-07-08 23:39:55,055 INFO L280 TraceCheckUtils]: 30: Hoare triple {965#false} ~i~0 := 1 + #t~post1; {965#false} is VALID [2020-07-08 23:39:55,056 INFO L280 TraceCheckUtils]: 31: Hoare triple {965#false} havoc #t~post1; {965#false} is VALID [2020-07-08 23:39:55,056 INFO L280 TraceCheckUtils]: 32: Hoare triple {965#false} assume !!(~i~0 < ~nlen~0); {965#false} is VALID [2020-07-08 23:39:55,056 INFO L280 TraceCheckUtils]: 33: Hoare triple {965#false} ~j~0 := 0; {965#false} is VALID [2020-07-08 23:39:55,057 INFO L280 TraceCheckUtils]: 34: Hoare triple {965#false} assume !!(~j~0 < 8); {965#false} is VALID [2020-07-08 23:39:55,057 INFO L263 TraceCheckUtils]: 35: Hoare triple {965#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {964#true} is VALID [2020-07-08 23:39:55,057 INFO L280 TraceCheckUtils]: 36: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-08 23:39:55,057 INFO L280 TraceCheckUtils]: 37: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-08 23:39:55,058 INFO L280 TraceCheckUtils]: 38: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-08 23:39:55,058 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {964#true} {965#false} #71#return; {965#false} is VALID [2020-07-08 23:39:55,058 INFO L263 TraceCheckUtils]: 40: Hoare triple {965#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {965#false} is VALID [2020-07-08 23:39:55,059 INFO L280 TraceCheckUtils]: 41: Hoare triple {965#false} ~cond := #in~cond; {965#false} is VALID [2020-07-08 23:39:55,059 INFO L280 TraceCheckUtils]: 42: Hoare triple {965#false} assume 0 == ~cond; {965#false} is VALID [2020-07-08 23:39:55,059 INFO L280 TraceCheckUtils]: 43: Hoare triple {965#false} assume !false; {965#false} is VALID [2020-07-08 23:39:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-08 23:39:55,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1293055861] [2020-07-08 23:39:55,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:39:55,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 23:39:55,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696340685] [2020-07-08 23:39:55,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-08 23:39:55,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:55,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:39:55,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:55,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:39:55,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:39:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:39:55,105 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-08 23:39:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:55,354 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2020-07-08 23:39:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:39:55,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-08 23:39:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:39:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:39:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-07-08 23:39:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:39:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-07-08 23:39:55,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2020-07-08 23:39:55,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:55,437 INFO L225 Difference]: With dead ends: 89 [2020-07-08 23:39:55,437 INFO L226 Difference]: Without dead ends: 67 [2020-07-08 23:39:55,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:39:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-08 23:39:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2020-07-08 23:39:55,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:39:55,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 59 states. [2020-07-08 23:39:55,539 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 59 states. [2020-07-08 23:39:55,540 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 59 states. [2020-07-08 23:39:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:55,545 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-08 23:39:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-07-08 23:39:55,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:55,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:55,547 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 67 states. [2020-07-08 23:39:55,547 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 67 states. [2020-07-08 23:39:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:55,552 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-08 23:39:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-07-08 23:39:55,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:55,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:55,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:39:55,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:39:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 23:39:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-08 23:39:55,557 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 44 [2020-07-08 23:39:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:39:55,558 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-08 23:39:55,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:39:55,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2020-07-08 23:39:55,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-08 23:39:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 23:39:55,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:55,649 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:39:55,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:39:55,650 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1839058219, now seen corresponding path program 2 times [2020-07-08 23:39:55,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:55,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [707023491] [2020-07-08 23:39:55,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,740 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1419#true} {1419#true} #67#return; {1419#true} is VALID [2020-07-08 23:39:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,753 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #71#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,771 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #73#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,787 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,788 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #71#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,798 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,798 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #73#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:55,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,805 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1420#false} #71#return; {1420#false} is VALID [2020-07-08 23:39:55,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {1419#true} call ULTIMATE.init(); {1419#true} is VALID [2020-07-08 23:39:55,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1419#true} {1419#true} #67#return; {1419#true} is VALID [2020-07-08 23:39:55,806 INFO L263 TraceCheckUtils]: 3: Hoare triple {1419#true} call #t~ret3 := main(); {1419#true} is VALID [2020-07-08 23:39:55,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {1419#true} havoc ~offset~0; {1419#true} is VALID [2020-07-08 23:39:55,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {1419#true} havoc ~length~0; {1419#true} is VALID [2020-07-08 23:39:55,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {1419#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1419#true} is VALID [2020-07-08 23:39:55,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {1419#true} ~nlen~0 := #t~nondet0; {1419#true} is VALID [2020-07-08 23:39:55,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {1419#true} havoc #t~nondet0; {1419#true} is VALID [2020-07-08 23:39:55,808 INFO L280 TraceCheckUtils]: 9: Hoare triple {1419#true} havoc ~i~0; {1419#true} is VALID [2020-07-08 23:39:55,808 INFO L280 TraceCheckUtils]: 10: Hoare triple {1419#true} havoc ~j~0; {1419#true} is VALID [2020-07-08 23:39:55,808 INFO L280 TraceCheckUtils]: 11: Hoare triple {1419#true} ~i~0 := 0; {1419#true} is VALID [2020-07-08 23:39:55,809 INFO L280 TraceCheckUtils]: 12: Hoare triple {1419#true} assume !!(~i~0 < ~nlen~0); {1419#true} is VALID [2020-07-08 23:39:55,810 INFO L280 TraceCheckUtils]: 13: Hoare triple {1419#true} ~j~0 := 0; {1423#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,811 INFO L280 TraceCheckUtils]: 14: Hoare triple {1423#(<= main_~j~0 0)} assume !!(~j~0 < 8); {1423#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,811 INFO L263 TraceCheckUtils]: 15: Hoare triple {1423#(<= main_~j~0 0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {1419#true} is VALID [2020-07-08 23:39:55,811 INFO L280 TraceCheckUtils]: 16: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,811 INFO L280 TraceCheckUtils]: 17: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,812 INFO L280 TraceCheckUtils]: 18: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,813 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #71#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,813 INFO L263 TraceCheckUtils]: 20: Hoare triple {1423#(<= main_~j~0 0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {1419#true} is VALID [2020-07-08 23:39:55,813 INFO L280 TraceCheckUtils]: 21: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,814 INFO L280 TraceCheckUtils]: 22: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,815 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #73#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:55,816 INFO L280 TraceCheckUtils]: 25: Hoare triple {1423#(<= main_~j~0 0)} #t~post2 := ~j~0; {1432#(<= |main_#t~post2| 0)} is VALID [2020-07-08 23:39:55,818 INFO L280 TraceCheckUtils]: 26: Hoare triple {1432#(<= |main_#t~post2| 0)} ~j~0 := 1 + #t~post2; {1433#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,819 INFO L280 TraceCheckUtils]: 27: Hoare triple {1433#(<= main_~j~0 1)} havoc #t~post2; {1433#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,820 INFO L280 TraceCheckUtils]: 28: Hoare triple {1433#(<= main_~j~0 1)} assume !!(~j~0 < 8); {1433#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,821 INFO L263 TraceCheckUtils]: 29: Hoare triple {1433#(<= main_~j~0 1)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {1419#true} is VALID [2020-07-08 23:39:55,821 INFO L280 TraceCheckUtils]: 30: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,821 INFO L280 TraceCheckUtils]: 31: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,821 INFO L280 TraceCheckUtils]: 32: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,822 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #71#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,823 INFO L263 TraceCheckUtils]: 34: Hoare triple {1433#(<= main_~j~0 1)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {1419#true} is VALID [2020-07-08 23:39:55,823 INFO L280 TraceCheckUtils]: 35: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,823 INFO L280 TraceCheckUtils]: 36: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,824 INFO L280 TraceCheckUtils]: 37: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,825 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #73#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:55,826 INFO L280 TraceCheckUtils]: 39: Hoare triple {1433#(<= main_~j~0 1)} #t~post2 := ~j~0; {1442#(<= |main_#t~post2| 1)} is VALID [2020-07-08 23:39:55,827 INFO L280 TraceCheckUtils]: 40: Hoare triple {1442#(<= |main_#t~post2| 1)} ~j~0 := 1 + #t~post2; {1443#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:55,828 INFO L280 TraceCheckUtils]: 41: Hoare triple {1443#(<= main_~j~0 2)} havoc #t~post2; {1443#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:55,829 INFO L280 TraceCheckUtils]: 42: Hoare triple {1443#(<= main_~j~0 2)} assume !(~j~0 < 8); {1420#false} is VALID [2020-07-08 23:39:55,829 INFO L280 TraceCheckUtils]: 43: Hoare triple {1420#false} #t~post1 := ~i~0; {1420#false} is VALID [2020-07-08 23:39:55,829 INFO L280 TraceCheckUtils]: 44: Hoare triple {1420#false} ~i~0 := 1 + #t~post1; {1420#false} is VALID [2020-07-08 23:39:55,830 INFO L280 TraceCheckUtils]: 45: Hoare triple {1420#false} havoc #t~post1; {1420#false} is VALID [2020-07-08 23:39:55,830 INFO L280 TraceCheckUtils]: 46: Hoare triple {1420#false} assume !!(~i~0 < ~nlen~0); {1420#false} is VALID [2020-07-08 23:39:55,830 INFO L280 TraceCheckUtils]: 47: Hoare triple {1420#false} ~j~0 := 0; {1420#false} is VALID [2020-07-08 23:39:55,830 INFO L280 TraceCheckUtils]: 48: Hoare triple {1420#false} assume !!(~j~0 < 8); {1420#false} is VALID [2020-07-08 23:39:55,831 INFO L263 TraceCheckUtils]: 49: Hoare triple {1420#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {1419#true} is VALID [2020-07-08 23:39:55,831 INFO L280 TraceCheckUtils]: 50: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-08 23:39:55,831 INFO L280 TraceCheckUtils]: 51: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-08 23:39:55,831 INFO L280 TraceCheckUtils]: 52: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-08 23:39:55,832 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {1419#true} {1420#false} #71#return; {1420#false} is VALID [2020-07-08 23:39:55,832 INFO L263 TraceCheckUtils]: 54: Hoare triple {1420#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {1420#false} is VALID [2020-07-08 23:39:55,832 INFO L280 TraceCheckUtils]: 55: Hoare triple {1420#false} ~cond := #in~cond; {1420#false} is VALID [2020-07-08 23:39:55,833 INFO L280 TraceCheckUtils]: 56: Hoare triple {1420#false} assume 0 == ~cond; {1420#false} is VALID [2020-07-08 23:39:55,833 INFO L280 TraceCheckUtils]: 57: Hoare triple {1420#false} assume !false; {1420#false} is VALID [2020-07-08 23:39:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-08 23:39:55,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [707023491] [2020-07-08 23:39:55,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:39:55,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 23:39:55,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294803088] [2020-07-08 23:39:55,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2020-07-08 23:39:55,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:55,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:39:55,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:55,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:39:55,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:39:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:39:55,892 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 7 states. [2020-07-08 23:39:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:56,229 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2020-07-08 23:39:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:39:56,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2020-07-08 23:39:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:39:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:39:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2020-07-08 23:39:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:39:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2020-07-08 23:39:56,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 74 transitions. [2020-07-08 23:39:56,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:56,306 INFO L225 Difference]: With dead ends: 107 [2020-07-08 23:39:56,306 INFO L226 Difference]: Without dead ends: 79 [2020-07-08 23:39:56,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:39:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-08 23:39:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2020-07-08 23:39:56,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:39:56,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 71 states. [2020-07-08 23:39:56,425 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 71 states. [2020-07-08 23:39:56,425 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 71 states. [2020-07-08 23:39:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:56,430 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2020-07-08 23:39:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-07-08 23:39:56,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:56,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:56,431 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 79 states. [2020-07-08 23:39:56,431 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 79 states. [2020-07-08 23:39:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:56,436 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2020-07-08 23:39:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-07-08 23:39:56,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:56,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:56,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:39:56,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:39:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-08 23:39:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2020-07-08 23:39:56,442 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 58 [2020-07-08 23:39:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:39:56,442 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2020-07-08 23:39:56,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:39:56,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 82 transitions. [2020-07-08 23:39:56,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-08 23:39:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-08 23:39:56,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:56,547 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:39:56,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:39:56,548 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash -101962, now seen corresponding path program 3 times [2020-07-08 23:39:56,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:56,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127057197] [2020-07-08 23:39:56,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,731 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1972#true} {1972#true} #67#return; {1972#true} is VALID [2020-07-08 23:39:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #71#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,764 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #73#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #71#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,797 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #73#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #71#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,816 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #73#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:56,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,821 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1973#false} #71#return; {1973#false} is VALID [2020-07-08 23:39:56,821 INFO L263 TraceCheckUtils]: 0: Hoare triple {1972#true} call ULTIMATE.init(); {1972#true} is VALID [2020-07-08 23:39:56,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,822 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1972#true} {1972#true} #67#return; {1972#true} is VALID [2020-07-08 23:39:56,822 INFO L263 TraceCheckUtils]: 3: Hoare triple {1972#true} call #t~ret3 := main(); {1972#true} is VALID [2020-07-08 23:39:56,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {1972#true} havoc ~offset~0; {1972#true} is VALID [2020-07-08 23:39:56,823 INFO L280 TraceCheckUtils]: 5: Hoare triple {1972#true} havoc ~length~0; {1972#true} is VALID [2020-07-08 23:39:56,823 INFO L280 TraceCheckUtils]: 6: Hoare triple {1972#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1972#true} is VALID [2020-07-08 23:39:56,823 INFO L280 TraceCheckUtils]: 7: Hoare triple {1972#true} ~nlen~0 := #t~nondet0; {1972#true} is VALID [2020-07-08 23:39:56,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {1972#true} havoc #t~nondet0; {1972#true} is VALID [2020-07-08 23:39:56,824 INFO L280 TraceCheckUtils]: 9: Hoare triple {1972#true} havoc ~i~0; {1972#true} is VALID [2020-07-08 23:39:56,824 INFO L280 TraceCheckUtils]: 10: Hoare triple {1972#true} havoc ~j~0; {1972#true} is VALID [2020-07-08 23:39:56,824 INFO L280 TraceCheckUtils]: 11: Hoare triple {1972#true} ~i~0 := 0; {1972#true} is VALID [2020-07-08 23:39:56,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {1972#true} assume !!(~i~0 < ~nlen~0); {1972#true} is VALID [2020-07-08 23:39:56,825 INFO L280 TraceCheckUtils]: 13: Hoare triple {1972#true} ~j~0 := 0; {1976#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:56,826 INFO L280 TraceCheckUtils]: 14: Hoare triple {1976#(<= main_~j~0 0)} assume !!(~j~0 < 8); {1976#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:56,826 INFO L263 TraceCheckUtils]: 15: Hoare triple {1976#(<= main_~j~0 0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {1972#true} is VALID [2020-07-08 23:39:56,826 INFO L280 TraceCheckUtils]: 16: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,826 INFO L280 TraceCheckUtils]: 17: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,827 INFO L280 TraceCheckUtils]: 18: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,827 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #71#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:56,828 INFO L263 TraceCheckUtils]: 20: Hoare triple {1976#(<= main_~j~0 0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {1972#true} is VALID [2020-07-08 23:39:56,828 INFO L280 TraceCheckUtils]: 21: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,828 INFO L280 TraceCheckUtils]: 22: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,829 INFO L280 TraceCheckUtils]: 23: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,830 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #73#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:56,831 INFO L280 TraceCheckUtils]: 25: Hoare triple {1976#(<= main_~j~0 0)} #t~post2 := ~j~0; {1985#(<= |main_#t~post2| 0)} is VALID [2020-07-08 23:39:56,832 INFO L280 TraceCheckUtils]: 26: Hoare triple {1985#(<= |main_#t~post2| 0)} ~j~0 := 1 + #t~post2; {1986#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:56,833 INFO L280 TraceCheckUtils]: 27: Hoare triple {1986#(<= main_~j~0 1)} havoc #t~post2; {1986#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:56,833 INFO L280 TraceCheckUtils]: 28: Hoare triple {1986#(<= main_~j~0 1)} assume !!(~j~0 < 8); {1986#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:56,833 INFO L263 TraceCheckUtils]: 29: Hoare triple {1986#(<= main_~j~0 1)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {1972#true} is VALID [2020-07-08 23:39:56,833 INFO L280 TraceCheckUtils]: 30: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,834 INFO L280 TraceCheckUtils]: 31: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,834 INFO L280 TraceCheckUtils]: 32: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,835 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #71#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:56,835 INFO L263 TraceCheckUtils]: 34: Hoare triple {1986#(<= main_~j~0 1)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {1972#true} is VALID [2020-07-08 23:39:56,835 INFO L280 TraceCheckUtils]: 35: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,835 INFO L280 TraceCheckUtils]: 36: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,835 INFO L280 TraceCheckUtils]: 37: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,836 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #73#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:56,838 INFO L280 TraceCheckUtils]: 39: Hoare triple {1986#(<= main_~j~0 1)} #t~post2 := ~j~0; {1995#(<= |main_#t~post2| 1)} is VALID [2020-07-08 23:39:56,839 INFO L280 TraceCheckUtils]: 40: Hoare triple {1995#(<= |main_#t~post2| 1)} ~j~0 := 1 + #t~post2; {1996#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:56,840 INFO L280 TraceCheckUtils]: 41: Hoare triple {1996#(<= main_~j~0 2)} havoc #t~post2; {1996#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:56,841 INFO L280 TraceCheckUtils]: 42: Hoare triple {1996#(<= main_~j~0 2)} assume !!(~j~0 < 8); {1996#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:56,841 INFO L263 TraceCheckUtils]: 43: Hoare triple {1996#(<= main_~j~0 2)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {1972#true} is VALID [2020-07-08 23:39:56,841 INFO L280 TraceCheckUtils]: 44: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,841 INFO L280 TraceCheckUtils]: 45: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,842 INFO L280 TraceCheckUtils]: 46: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,842 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #71#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:56,843 INFO L263 TraceCheckUtils]: 48: Hoare triple {1996#(<= main_~j~0 2)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {1972#true} is VALID [2020-07-08 23:39:56,843 INFO L280 TraceCheckUtils]: 49: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,843 INFO L280 TraceCheckUtils]: 50: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,843 INFO L280 TraceCheckUtils]: 51: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,844 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #73#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:56,846 INFO L280 TraceCheckUtils]: 53: Hoare triple {1996#(<= main_~j~0 2)} #t~post2 := ~j~0; {2005#(<= |main_#t~post2| 2)} is VALID [2020-07-08 23:39:56,847 INFO L280 TraceCheckUtils]: 54: Hoare triple {2005#(<= |main_#t~post2| 2)} ~j~0 := 1 + #t~post2; {2006#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:56,848 INFO L280 TraceCheckUtils]: 55: Hoare triple {2006#(<= main_~j~0 3)} havoc #t~post2; {2006#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:56,849 INFO L280 TraceCheckUtils]: 56: Hoare triple {2006#(<= main_~j~0 3)} assume !(~j~0 < 8); {1973#false} is VALID [2020-07-08 23:39:56,849 INFO L280 TraceCheckUtils]: 57: Hoare triple {1973#false} #t~post1 := ~i~0; {1973#false} is VALID [2020-07-08 23:39:56,849 INFO L280 TraceCheckUtils]: 58: Hoare triple {1973#false} ~i~0 := 1 + #t~post1; {1973#false} is VALID [2020-07-08 23:39:56,849 INFO L280 TraceCheckUtils]: 59: Hoare triple {1973#false} havoc #t~post1; {1973#false} is VALID [2020-07-08 23:39:56,850 INFO L280 TraceCheckUtils]: 60: Hoare triple {1973#false} assume !!(~i~0 < ~nlen~0); {1973#false} is VALID [2020-07-08 23:39:56,850 INFO L280 TraceCheckUtils]: 61: Hoare triple {1973#false} ~j~0 := 0; {1973#false} is VALID [2020-07-08 23:39:56,850 INFO L280 TraceCheckUtils]: 62: Hoare triple {1973#false} assume !!(~j~0 < 8); {1973#false} is VALID [2020-07-08 23:39:56,850 INFO L263 TraceCheckUtils]: 63: Hoare triple {1973#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {1972#true} is VALID [2020-07-08 23:39:56,851 INFO L280 TraceCheckUtils]: 64: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-08 23:39:56,851 INFO L280 TraceCheckUtils]: 65: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-08 23:39:56,851 INFO L280 TraceCheckUtils]: 66: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-08 23:39:56,851 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {1972#true} {1973#false} #71#return; {1973#false} is VALID [2020-07-08 23:39:56,852 INFO L263 TraceCheckUtils]: 68: Hoare triple {1973#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {1973#false} is VALID [2020-07-08 23:39:56,852 INFO L280 TraceCheckUtils]: 69: Hoare triple {1973#false} ~cond := #in~cond; {1973#false} is VALID [2020-07-08 23:39:56,852 INFO L280 TraceCheckUtils]: 70: Hoare triple {1973#false} assume 0 == ~cond; {1973#false} is VALID [2020-07-08 23:39:56,852 INFO L280 TraceCheckUtils]: 71: Hoare triple {1973#false} assume !false; {1973#false} is VALID [2020-07-08 23:39:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-08 23:39:56,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127057197] [2020-07-08 23:39:56,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:39:56,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:39:56,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337932105] [2020-07-08 23:39:56,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-07-08 23:39:56,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:56,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:39:56,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:56,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:39:56,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:39:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:39:56,918 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 9 states. [2020-07-08 23:39:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:57,411 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2020-07-08 23:39:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:39:57,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-07-08 23:39:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:39:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:39:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-08 23:39:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:39:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-08 23:39:57,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2020-07-08 23:39:57,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:57,512 INFO L225 Difference]: With dead ends: 125 [2020-07-08 23:39:57,512 INFO L226 Difference]: Without dead ends: 91 [2020-07-08 23:39:57,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:39:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-08 23:39:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2020-07-08 23:39:57,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:39:57,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 83 states. [2020-07-08 23:39:57,684 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 83 states. [2020-07-08 23:39:57,685 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 83 states. [2020-07-08 23:39:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:57,690 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-07-08 23:39:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-07-08 23:39:57,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:57,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:57,691 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 91 states. [2020-07-08 23:39:57,691 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 91 states. [2020-07-08 23:39:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:57,696 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-07-08 23:39:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-07-08 23:39:57,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:57,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:57,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:39:57,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:39:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-08 23:39:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2020-07-08 23:39:57,702 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 72 [2020-07-08 23:39:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:39:57,703 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2020-07-08 23:39:57,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:39:57,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 98 transitions. [2020-07-08 23:39:57,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2020-07-08 23:39:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-08 23:39:57,840 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:57,840 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:39:57,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:39:57,841 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1976659241, now seen corresponding path program 4 times [2020-07-08 23:39:57,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:57,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287366705] [2020-07-08 23:39:57,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:57,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:57,992 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2623#true} {2623#true} #67#return; {2623#true} is VALID [2020-07-08 23:39:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:57,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:57,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:57,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:57,999 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #71#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,006 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,007 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #73#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,016 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #71#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,024 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #73#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,030 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,031 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,032 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #71#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,040 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #73#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,049 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #71#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,057 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,058 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,059 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #73#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:58,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,066 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2624#false} #71#return; {2624#false} is VALID [2020-07-08 23:39:58,066 INFO L263 TraceCheckUtils]: 0: Hoare triple {2623#true} call ULTIMATE.init(); {2623#true} is VALID [2020-07-08 23:39:58,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,067 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2623#true} {2623#true} #67#return; {2623#true} is VALID [2020-07-08 23:39:58,068 INFO L263 TraceCheckUtils]: 3: Hoare triple {2623#true} call #t~ret3 := main(); {2623#true} is VALID [2020-07-08 23:39:58,068 INFO L280 TraceCheckUtils]: 4: Hoare triple {2623#true} havoc ~offset~0; {2623#true} is VALID [2020-07-08 23:39:58,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {2623#true} havoc ~length~0; {2623#true} is VALID [2020-07-08 23:39:58,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {2623#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2623#true} is VALID [2020-07-08 23:39:58,069 INFO L280 TraceCheckUtils]: 7: Hoare triple {2623#true} ~nlen~0 := #t~nondet0; {2623#true} is VALID [2020-07-08 23:39:58,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {2623#true} havoc #t~nondet0; {2623#true} is VALID [2020-07-08 23:39:58,070 INFO L280 TraceCheckUtils]: 9: Hoare triple {2623#true} havoc ~i~0; {2623#true} is VALID [2020-07-08 23:39:58,070 INFO L280 TraceCheckUtils]: 10: Hoare triple {2623#true} havoc ~j~0; {2623#true} is VALID [2020-07-08 23:39:58,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {2623#true} ~i~0 := 0; {2623#true} is VALID [2020-07-08 23:39:58,070 INFO L280 TraceCheckUtils]: 12: Hoare triple {2623#true} assume !!(~i~0 < ~nlen~0); {2623#true} is VALID [2020-07-08 23:39:58,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {2623#true} ~j~0 := 0; {2627#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:58,072 INFO L280 TraceCheckUtils]: 14: Hoare triple {2627#(<= main_~j~0 0)} assume !!(~j~0 < 8); {2627#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:58,072 INFO L263 TraceCheckUtils]: 15: Hoare triple {2627#(<= main_~j~0 0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,073 INFO L280 TraceCheckUtils]: 16: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,073 INFO L280 TraceCheckUtils]: 17: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,073 INFO L280 TraceCheckUtils]: 18: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,075 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #71#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:58,075 INFO L263 TraceCheckUtils]: 20: Hoare triple {2627#(<= main_~j~0 0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,075 INFO L280 TraceCheckUtils]: 21: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,075 INFO L280 TraceCheckUtils]: 22: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,076 INFO L280 TraceCheckUtils]: 23: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,077 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #73#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:58,077 INFO L280 TraceCheckUtils]: 25: Hoare triple {2627#(<= main_~j~0 0)} #t~post2 := ~j~0; {2636#(<= |main_#t~post2| 0)} is VALID [2020-07-08 23:39:58,079 INFO L280 TraceCheckUtils]: 26: Hoare triple {2636#(<= |main_#t~post2| 0)} ~j~0 := 1 + #t~post2; {2637#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:58,080 INFO L280 TraceCheckUtils]: 27: Hoare triple {2637#(<= main_~j~0 1)} havoc #t~post2; {2637#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:58,080 INFO L280 TraceCheckUtils]: 28: Hoare triple {2637#(<= main_~j~0 1)} assume !!(~j~0 < 8); {2637#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:58,081 INFO L263 TraceCheckUtils]: 29: Hoare triple {2637#(<= main_~j~0 1)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,081 INFO L280 TraceCheckUtils]: 30: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,081 INFO L280 TraceCheckUtils]: 31: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,082 INFO L280 TraceCheckUtils]: 32: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,083 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #71#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:58,083 INFO L263 TraceCheckUtils]: 34: Hoare triple {2637#(<= main_~j~0 1)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,083 INFO L280 TraceCheckUtils]: 35: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,083 INFO L280 TraceCheckUtils]: 36: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,084 INFO L280 TraceCheckUtils]: 37: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,084 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #73#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:58,085 INFO L280 TraceCheckUtils]: 39: Hoare triple {2637#(<= main_~j~0 1)} #t~post2 := ~j~0; {2646#(<= |main_#t~post2| 1)} is VALID [2020-07-08 23:39:58,086 INFO L280 TraceCheckUtils]: 40: Hoare triple {2646#(<= |main_#t~post2| 1)} ~j~0 := 1 + #t~post2; {2647#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:58,086 INFO L280 TraceCheckUtils]: 41: Hoare triple {2647#(<= main_~j~0 2)} havoc #t~post2; {2647#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:58,087 INFO L280 TraceCheckUtils]: 42: Hoare triple {2647#(<= main_~j~0 2)} assume !!(~j~0 < 8); {2647#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:58,087 INFO L263 TraceCheckUtils]: 43: Hoare triple {2647#(<= main_~j~0 2)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,088 INFO L280 TraceCheckUtils]: 44: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,088 INFO L280 TraceCheckUtils]: 45: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,088 INFO L280 TraceCheckUtils]: 46: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,089 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #71#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:58,090 INFO L263 TraceCheckUtils]: 48: Hoare triple {2647#(<= main_~j~0 2)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,090 INFO L280 TraceCheckUtils]: 49: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,091 INFO L280 TraceCheckUtils]: 50: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,091 INFO L280 TraceCheckUtils]: 51: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,092 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #73#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:58,093 INFO L280 TraceCheckUtils]: 53: Hoare triple {2647#(<= main_~j~0 2)} #t~post2 := ~j~0; {2656#(<= |main_#t~post2| 2)} is VALID [2020-07-08 23:39:58,094 INFO L280 TraceCheckUtils]: 54: Hoare triple {2656#(<= |main_#t~post2| 2)} ~j~0 := 1 + #t~post2; {2657#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:58,095 INFO L280 TraceCheckUtils]: 55: Hoare triple {2657#(<= main_~j~0 3)} havoc #t~post2; {2657#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:58,096 INFO L280 TraceCheckUtils]: 56: Hoare triple {2657#(<= main_~j~0 3)} assume !!(~j~0 < 8); {2657#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:58,097 INFO L263 TraceCheckUtils]: 57: Hoare triple {2657#(<= main_~j~0 3)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,097 INFO L280 TraceCheckUtils]: 58: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,097 INFO L280 TraceCheckUtils]: 59: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,097 INFO L280 TraceCheckUtils]: 60: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,098 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #71#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:58,099 INFO L263 TraceCheckUtils]: 62: Hoare triple {2657#(<= main_~j~0 3)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,099 INFO L280 TraceCheckUtils]: 63: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,099 INFO L280 TraceCheckUtils]: 64: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,099 INFO L280 TraceCheckUtils]: 65: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,100 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #73#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:58,101 INFO L280 TraceCheckUtils]: 67: Hoare triple {2657#(<= main_~j~0 3)} #t~post2 := ~j~0; {2666#(<= |main_#t~post2| 3)} is VALID [2020-07-08 23:39:58,102 INFO L280 TraceCheckUtils]: 68: Hoare triple {2666#(<= |main_#t~post2| 3)} ~j~0 := 1 + #t~post2; {2667#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:58,102 INFO L280 TraceCheckUtils]: 69: Hoare triple {2667#(<= main_~j~0 4)} havoc #t~post2; {2667#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:58,104 INFO L280 TraceCheckUtils]: 70: Hoare triple {2667#(<= main_~j~0 4)} assume !(~j~0 < 8); {2624#false} is VALID [2020-07-08 23:39:58,104 INFO L280 TraceCheckUtils]: 71: Hoare triple {2624#false} #t~post1 := ~i~0; {2624#false} is VALID [2020-07-08 23:39:58,104 INFO L280 TraceCheckUtils]: 72: Hoare triple {2624#false} ~i~0 := 1 + #t~post1; {2624#false} is VALID [2020-07-08 23:39:58,105 INFO L280 TraceCheckUtils]: 73: Hoare triple {2624#false} havoc #t~post1; {2624#false} is VALID [2020-07-08 23:39:58,105 INFO L280 TraceCheckUtils]: 74: Hoare triple {2624#false} assume !!(~i~0 < ~nlen~0); {2624#false} is VALID [2020-07-08 23:39:58,105 INFO L280 TraceCheckUtils]: 75: Hoare triple {2624#false} ~j~0 := 0; {2624#false} is VALID [2020-07-08 23:39:58,106 INFO L280 TraceCheckUtils]: 76: Hoare triple {2624#false} assume !!(~j~0 < 8); {2624#false} is VALID [2020-07-08 23:39:58,106 INFO L263 TraceCheckUtils]: 77: Hoare triple {2624#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {2623#true} is VALID [2020-07-08 23:39:58,106 INFO L280 TraceCheckUtils]: 78: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-08 23:39:58,106 INFO L280 TraceCheckUtils]: 79: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-08 23:39:58,106 INFO L280 TraceCheckUtils]: 80: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-08 23:39:58,107 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {2623#true} {2624#false} #71#return; {2624#false} is VALID [2020-07-08 23:39:58,107 INFO L263 TraceCheckUtils]: 82: Hoare triple {2624#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {2624#false} is VALID [2020-07-08 23:39:58,107 INFO L280 TraceCheckUtils]: 83: Hoare triple {2624#false} ~cond := #in~cond; {2624#false} is VALID [2020-07-08 23:39:58,107 INFO L280 TraceCheckUtils]: 84: Hoare triple {2624#false} assume 0 == ~cond; {2624#false} is VALID [2020-07-08 23:39:58,107 INFO L280 TraceCheckUtils]: 85: Hoare triple {2624#false} assume !false; {2624#false} is VALID [2020-07-08 23:39:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 33 proven. 40 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-07-08 23:39:58,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287366705] [2020-07-08 23:39:58,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:39:58,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:39:58,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995814250] [2020-07-08 23:39:58,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2020-07-08 23:39:58,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:58,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:39:58,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:58,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:39:58,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:39:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:39:58,212 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand 11 states. [2020-07-08 23:39:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:58,854 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2020-07-08 23:39:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 23:39:58,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2020-07-08 23:39:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:39:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:39:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2020-07-08 23:39:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:39:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2020-07-08 23:39:58,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 90 transitions. [2020-07-08 23:39:58,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:58,961 INFO L225 Difference]: With dead ends: 143 [2020-07-08 23:39:58,961 INFO L226 Difference]: Without dead ends: 103 [2020-07-08 23:39:58,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2020-07-08 23:39:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-08 23:39:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2020-07-08 23:39:59,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:39:59,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 95 states. [2020-07-08 23:39:59,172 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 95 states. [2020-07-08 23:39:59,172 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 95 states. [2020-07-08 23:39:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:59,178 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2020-07-08 23:39:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2020-07-08 23:39:59,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:59,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:59,179 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 103 states. [2020-07-08 23:39:59,180 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 103 states. [2020-07-08 23:39:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:39:59,185 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2020-07-08 23:39:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2020-07-08 23:39:59,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:39:59,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:39:59,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:39:59,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:39:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-08 23:39:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2020-07-08 23:39:59,191 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 86 [2020-07-08 23:39:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:39:59,192 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2020-07-08 23:39:59,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:39:59,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 114 transitions. [2020-07-08 23:39:59,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:39:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2020-07-08 23:39:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-07-08 23:39:59,344 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:39:59,344 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:39:59,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:39:59,345 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:39:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:39:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1582933560, now seen corresponding path program 5 times [2020-07-08 23:39:59,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:39:59,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214354644] [2020-07-08 23:39:59,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:39:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,534 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3372#true} {3372#true} #67#return; {3372#true} is VALID [2020-07-08 23:39:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,546 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #71#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,556 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #73#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #71#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,583 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #73#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,597 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #71#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,604 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,605 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #73#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,614 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #71#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,636 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #73#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #71#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,660 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #73#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:39:59,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,671 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3373#false} #71#return; {3373#false} is VALID [2020-07-08 23:39:59,672 INFO L263 TraceCheckUtils]: 0: Hoare triple {3372#true} call ULTIMATE.init(); {3372#true} is VALID [2020-07-08 23:39:59,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,672 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3372#true} {3372#true} #67#return; {3372#true} is VALID [2020-07-08 23:39:59,672 INFO L263 TraceCheckUtils]: 3: Hoare triple {3372#true} call #t~ret3 := main(); {3372#true} is VALID [2020-07-08 23:39:59,673 INFO L280 TraceCheckUtils]: 4: Hoare triple {3372#true} havoc ~offset~0; {3372#true} is VALID [2020-07-08 23:39:59,673 INFO L280 TraceCheckUtils]: 5: Hoare triple {3372#true} havoc ~length~0; {3372#true} is VALID [2020-07-08 23:39:59,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {3372#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3372#true} is VALID [2020-07-08 23:39:59,673 INFO L280 TraceCheckUtils]: 7: Hoare triple {3372#true} ~nlen~0 := #t~nondet0; {3372#true} is VALID [2020-07-08 23:39:59,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {3372#true} havoc #t~nondet0; {3372#true} is VALID [2020-07-08 23:39:59,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {3372#true} havoc ~i~0; {3372#true} is VALID [2020-07-08 23:39:59,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {3372#true} havoc ~j~0; {3372#true} is VALID [2020-07-08 23:39:59,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {3372#true} ~i~0 := 0; {3372#true} is VALID [2020-07-08 23:39:59,675 INFO L280 TraceCheckUtils]: 12: Hoare triple {3372#true} assume !!(~i~0 < ~nlen~0); {3372#true} is VALID [2020-07-08 23:39:59,687 INFO L280 TraceCheckUtils]: 13: Hoare triple {3372#true} ~j~0 := 0; {3376#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:59,692 INFO L280 TraceCheckUtils]: 14: Hoare triple {3376#(<= main_~j~0 0)} assume !!(~j~0 < 8); {3376#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:59,693 INFO L263 TraceCheckUtils]: 15: Hoare triple {3376#(<= main_~j~0 0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,694 INFO L280 TraceCheckUtils]: 18: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,699 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #71#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:59,699 INFO L263 TraceCheckUtils]: 20: Hoare triple {3376#(<= main_~j~0 0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,700 INFO L280 TraceCheckUtils]: 21: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,700 INFO L280 TraceCheckUtils]: 22: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,700 INFO L280 TraceCheckUtils]: 23: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,701 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #73#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-08 23:39:59,702 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#(<= main_~j~0 0)} #t~post2 := ~j~0; {3385#(<= |main_#t~post2| 0)} is VALID [2020-07-08 23:39:59,703 INFO L280 TraceCheckUtils]: 26: Hoare triple {3385#(<= |main_#t~post2| 0)} ~j~0 := 1 + #t~post2; {3386#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:59,703 INFO L280 TraceCheckUtils]: 27: Hoare triple {3386#(<= main_~j~0 1)} havoc #t~post2; {3386#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:59,704 INFO L280 TraceCheckUtils]: 28: Hoare triple {3386#(<= main_~j~0 1)} assume !!(~j~0 < 8); {3386#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:59,704 INFO L263 TraceCheckUtils]: 29: Hoare triple {3386#(<= main_~j~0 1)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,704 INFO L280 TraceCheckUtils]: 31: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,705 INFO L280 TraceCheckUtils]: 32: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,705 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #71#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:59,706 INFO L263 TraceCheckUtils]: 34: Hoare triple {3386#(<= main_~j~0 1)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,706 INFO L280 TraceCheckUtils]: 35: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,706 INFO L280 TraceCheckUtils]: 36: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,706 INFO L280 TraceCheckUtils]: 37: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,707 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #73#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-08 23:39:59,708 INFO L280 TraceCheckUtils]: 39: Hoare triple {3386#(<= main_~j~0 1)} #t~post2 := ~j~0; {3395#(<= |main_#t~post2| 1)} is VALID [2020-07-08 23:39:59,709 INFO L280 TraceCheckUtils]: 40: Hoare triple {3395#(<= |main_#t~post2| 1)} ~j~0 := 1 + #t~post2; {3396#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:59,709 INFO L280 TraceCheckUtils]: 41: Hoare triple {3396#(<= main_~j~0 2)} havoc #t~post2; {3396#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:59,710 INFO L280 TraceCheckUtils]: 42: Hoare triple {3396#(<= main_~j~0 2)} assume !!(~j~0 < 8); {3396#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:59,710 INFO L263 TraceCheckUtils]: 43: Hoare triple {3396#(<= main_~j~0 2)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,710 INFO L280 TraceCheckUtils]: 44: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,711 INFO L280 TraceCheckUtils]: 45: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,711 INFO L280 TraceCheckUtils]: 46: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,712 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #71#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:59,712 INFO L263 TraceCheckUtils]: 48: Hoare triple {3396#(<= main_~j~0 2)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,712 INFO L280 TraceCheckUtils]: 49: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,712 INFO L280 TraceCheckUtils]: 50: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,713 INFO L280 TraceCheckUtils]: 51: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,713 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #73#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-08 23:39:59,714 INFO L280 TraceCheckUtils]: 53: Hoare triple {3396#(<= main_~j~0 2)} #t~post2 := ~j~0; {3405#(<= |main_#t~post2| 2)} is VALID [2020-07-08 23:39:59,715 INFO L280 TraceCheckUtils]: 54: Hoare triple {3405#(<= |main_#t~post2| 2)} ~j~0 := 1 + #t~post2; {3406#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:59,715 INFO L280 TraceCheckUtils]: 55: Hoare triple {3406#(<= main_~j~0 3)} havoc #t~post2; {3406#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:59,716 INFO L280 TraceCheckUtils]: 56: Hoare triple {3406#(<= main_~j~0 3)} assume !!(~j~0 < 8); {3406#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:59,716 INFO L263 TraceCheckUtils]: 57: Hoare triple {3406#(<= main_~j~0 3)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,716 INFO L280 TraceCheckUtils]: 58: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,716 INFO L280 TraceCheckUtils]: 59: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,717 INFO L280 TraceCheckUtils]: 60: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,718 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #71#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:59,718 INFO L263 TraceCheckUtils]: 62: Hoare triple {3406#(<= main_~j~0 3)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,718 INFO L280 TraceCheckUtils]: 63: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,718 INFO L280 TraceCheckUtils]: 64: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,718 INFO L280 TraceCheckUtils]: 65: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,720 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #73#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-08 23:39:59,721 INFO L280 TraceCheckUtils]: 67: Hoare triple {3406#(<= main_~j~0 3)} #t~post2 := ~j~0; {3415#(<= |main_#t~post2| 3)} is VALID [2020-07-08 23:39:59,722 INFO L280 TraceCheckUtils]: 68: Hoare triple {3415#(<= |main_#t~post2| 3)} ~j~0 := 1 + #t~post2; {3416#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:59,724 INFO L280 TraceCheckUtils]: 69: Hoare triple {3416#(<= main_~j~0 4)} havoc #t~post2; {3416#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:59,725 INFO L280 TraceCheckUtils]: 70: Hoare triple {3416#(<= main_~j~0 4)} assume !!(~j~0 < 8); {3416#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:59,725 INFO L263 TraceCheckUtils]: 71: Hoare triple {3416#(<= main_~j~0 4)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,725 INFO L280 TraceCheckUtils]: 72: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,725 INFO L280 TraceCheckUtils]: 73: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,725 INFO L280 TraceCheckUtils]: 74: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,726 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #71#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:59,726 INFO L263 TraceCheckUtils]: 76: Hoare triple {3416#(<= main_~j~0 4)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,726 INFO L280 TraceCheckUtils]: 77: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,727 INFO L280 TraceCheckUtils]: 78: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,727 INFO L280 TraceCheckUtils]: 79: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,727 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #73#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-08 23:39:59,728 INFO L280 TraceCheckUtils]: 81: Hoare triple {3416#(<= main_~j~0 4)} #t~post2 := ~j~0; {3425#(<= |main_#t~post2| 4)} is VALID [2020-07-08 23:39:59,729 INFO L280 TraceCheckUtils]: 82: Hoare triple {3425#(<= |main_#t~post2| 4)} ~j~0 := 1 + #t~post2; {3426#(<= main_~j~0 5)} is VALID [2020-07-08 23:39:59,729 INFO L280 TraceCheckUtils]: 83: Hoare triple {3426#(<= main_~j~0 5)} havoc #t~post2; {3426#(<= main_~j~0 5)} is VALID [2020-07-08 23:39:59,730 INFO L280 TraceCheckUtils]: 84: Hoare triple {3426#(<= main_~j~0 5)} assume !(~j~0 < 8); {3373#false} is VALID [2020-07-08 23:39:59,730 INFO L280 TraceCheckUtils]: 85: Hoare triple {3373#false} #t~post1 := ~i~0; {3373#false} is VALID [2020-07-08 23:39:59,730 INFO L280 TraceCheckUtils]: 86: Hoare triple {3373#false} ~i~0 := 1 + #t~post1; {3373#false} is VALID [2020-07-08 23:39:59,730 INFO L280 TraceCheckUtils]: 87: Hoare triple {3373#false} havoc #t~post1; {3373#false} is VALID [2020-07-08 23:39:59,730 INFO L280 TraceCheckUtils]: 88: Hoare triple {3373#false} assume !!(~i~0 < ~nlen~0); {3373#false} is VALID [2020-07-08 23:39:59,730 INFO L280 TraceCheckUtils]: 89: Hoare triple {3373#false} ~j~0 := 0; {3373#false} is VALID [2020-07-08 23:39:59,731 INFO L280 TraceCheckUtils]: 90: Hoare triple {3373#false} assume !!(~j~0 < 8); {3373#false} is VALID [2020-07-08 23:39:59,731 INFO L263 TraceCheckUtils]: 91: Hoare triple {3373#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {3372#true} is VALID [2020-07-08 23:39:59,731 INFO L280 TraceCheckUtils]: 92: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-08 23:39:59,731 INFO L280 TraceCheckUtils]: 93: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-08 23:39:59,732 INFO L280 TraceCheckUtils]: 94: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-08 23:39:59,732 INFO L275 TraceCheckUtils]: 95: Hoare quadruple {3372#true} {3373#false} #71#return; {3373#false} is VALID [2020-07-08 23:39:59,732 INFO L263 TraceCheckUtils]: 96: Hoare triple {3373#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {3373#false} is VALID [2020-07-08 23:39:59,732 INFO L280 TraceCheckUtils]: 97: Hoare triple {3373#false} ~cond := #in~cond; {3373#false} is VALID [2020-07-08 23:39:59,732 INFO L280 TraceCheckUtils]: 98: Hoare triple {3373#false} assume 0 == ~cond; {3373#false} is VALID [2020-07-08 23:39:59,733 INFO L280 TraceCheckUtils]: 99: Hoare triple {3373#false} assume !false; {3373#false} is VALID [2020-07-08 23:39:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 40 proven. 65 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-07-08 23:39:59,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214354644] [2020-07-08 23:39:59,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:39:59,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:39:59,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766896868] [2020-07-08 23:39:59,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2020-07-08 23:39:59,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:39:59,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:39:59,830 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 23:39:59,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:39:59,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:39:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:39:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:39:59,832 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 13 states. [2020-07-08 23:40:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:00,559 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2020-07-08 23:40:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 23:40:00,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2020-07-08 23:40:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:40:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2020-07-08 23:40:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:40:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2020-07-08 23:40:00,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 98 transitions. [2020-07-08 23:40:00,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:00,684 INFO L225 Difference]: With dead ends: 161 [2020-07-08 23:40:00,684 INFO L226 Difference]: Without dead ends: 115 [2020-07-08 23:40:00,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2020-07-08 23:40:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-08 23:40:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2020-07-08 23:40:00,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:00,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 107 states. [2020-07-08 23:40:00,921 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 107 states. [2020-07-08 23:40:00,922 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 107 states. [2020-07-08 23:40:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:00,933 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2020-07-08 23:40:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2020-07-08 23:40:00,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:00,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:00,934 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 115 states. [2020-07-08 23:40:00,934 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 115 states. [2020-07-08 23:40:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:00,947 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2020-07-08 23:40:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2020-07-08 23:40:00,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:00,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:00,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:00,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-08 23:40:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2020-07-08 23:40:00,958 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 100 [2020-07-08 23:40:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:00,958 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2020-07-08 23:40:00,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:40:00,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 130 transitions. [2020-07-08 23:40:01,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2020-07-08 23:40:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-07-08 23:40:01,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:01,136 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:01,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:40:01,136 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1615510489, now seen corresponding path program 6 times [2020-07-08 23:40:01,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:01,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727530031] [2020-07-08 23:40:01,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,366 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4219#true} {4219#true} #67#return; {4219#true} is VALID [2020-07-08 23:40:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,373 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #71#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,380 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #73#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,386 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #71#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,392 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #73#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,399 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,400 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #71#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,405 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,406 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #73#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,413 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #71#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #73#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,429 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #71#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #73#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #71#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,448 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #73#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:01,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,453 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4220#false} #71#return; {4220#false} is VALID [2020-07-08 23:40:01,453 INFO L263 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2020-07-08 23:40:01,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,454 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4219#true} {4219#true} #67#return; {4219#true} is VALID [2020-07-08 23:40:01,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {4219#true} call #t~ret3 := main(); {4219#true} is VALID [2020-07-08 23:40:01,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {4219#true} havoc ~offset~0; {4219#true} is VALID [2020-07-08 23:40:01,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {4219#true} havoc ~length~0; {4219#true} is VALID [2020-07-08 23:40:01,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {4219#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4219#true} is VALID [2020-07-08 23:40:01,455 INFO L280 TraceCheckUtils]: 7: Hoare triple {4219#true} ~nlen~0 := #t~nondet0; {4219#true} is VALID [2020-07-08 23:40:01,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {4219#true} havoc #t~nondet0; {4219#true} is VALID [2020-07-08 23:40:01,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {4219#true} havoc ~i~0; {4219#true} is VALID [2020-07-08 23:40:01,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {4219#true} havoc ~j~0; {4219#true} is VALID [2020-07-08 23:40:01,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {4219#true} ~i~0 := 0; {4219#true} is VALID [2020-07-08 23:40:01,456 INFO L280 TraceCheckUtils]: 12: Hoare triple {4219#true} assume !!(~i~0 < ~nlen~0); {4219#true} is VALID [2020-07-08 23:40:01,456 INFO L280 TraceCheckUtils]: 13: Hoare triple {4219#true} ~j~0 := 0; {4223#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:01,457 INFO L280 TraceCheckUtils]: 14: Hoare triple {4223#(<= main_~j~0 0)} assume !!(~j~0 < 8); {4223#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:01,457 INFO L263 TraceCheckUtils]: 15: Hoare triple {4223#(<= main_~j~0 0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,458 INFO L280 TraceCheckUtils]: 18: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,459 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #71#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:01,459 INFO L263 TraceCheckUtils]: 20: Hoare triple {4223#(<= main_~j~0 0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,459 INFO L280 TraceCheckUtils]: 21: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,459 INFO L280 TraceCheckUtils]: 22: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,459 INFO L280 TraceCheckUtils]: 23: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,460 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #73#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:01,461 INFO L280 TraceCheckUtils]: 25: Hoare triple {4223#(<= main_~j~0 0)} #t~post2 := ~j~0; {4232#(<= |main_#t~post2| 0)} is VALID [2020-07-08 23:40:01,462 INFO L280 TraceCheckUtils]: 26: Hoare triple {4232#(<= |main_#t~post2| 0)} ~j~0 := 1 + #t~post2; {4233#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:01,463 INFO L280 TraceCheckUtils]: 27: Hoare triple {4233#(<= main_~j~0 1)} havoc #t~post2; {4233#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:01,463 INFO L280 TraceCheckUtils]: 28: Hoare triple {4233#(<= main_~j~0 1)} assume !!(~j~0 < 8); {4233#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:01,463 INFO L263 TraceCheckUtils]: 29: Hoare triple {4233#(<= main_~j~0 1)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,463 INFO L280 TraceCheckUtils]: 30: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,464 INFO L280 TraceCheckUtils]: 31: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,464 INFO L280 TraceCheckUtils]: 32: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,465 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #71#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:01,465 INFO L263 TraceCheckUtils]: 34: Hoare triple {4233#(<= main_~j~0 1)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,465 INFO L280 TraceCheckUtils]: 35: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,465 INFO L280 TraceCheckUtils]: 36: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,465 INFO L280 TraceCheckUtils]: 37: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,466 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #73#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:01,467 INFO L280 TraceCheckUtils]: 39: Hoare triple {4233#(<= main_~j~0 1)} #t~post2 := ~j~0; {4242#(<= |main_#t~post2| 1)} is VALID [2020-07-08 23:40:01,468 INFO L280 TraceCheckUtils]: 40: Hoare triple {4242#(<= |main_#t~post2| 1)} ~j~0 := 1 + #t~post2; {4243#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:01,468 INFO L280 TraceCheckUtils]: 41: Hoare triple {4243#(<= main_~j~0 2)} havoc #t~post2; {4243#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:01,469 INFO L280 TraceCheckUtils]: 42: Hoare triple {4243#(<= main_~j~0 2)} assume !!(~j~0 < 8); {4243#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:01,469 INFO L263 TraceCheckUtils]: 43: Hoare triple {4243#(<= main_~j~0 2)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,469 INFO L280 TraceCheckUtils]: 44: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,470 INFO L280 TraceCheckUtils]: 45: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,470 INFO L280 TraceCheckUtils]: 46: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,471 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #71#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:01,471 INFO L263 TraceCheckUtils]: 48: Hoare triple {4243#(<= main_~j~0 2)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,471 INFO L280 TraceCheckUtils]: 49: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,471 INFO L280 TraceCheckUtils]: 50: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,472 INFO L280 TraceCheckUtils]: 51: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,472 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #73#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:01,473 INFO L280 TraceCheckUtils]: 53: Hoare triple {4243#(<= main_~j~0 2)} #t~post2 := ~j~0; {4252#(<= |main_#t~post2| 2)} is VALID [2020-07-08 23:40:01,474 INFO L280 TraceCheckUtils]: 54: Hoare triple {4252#(<= |main_#t~post2| 2)} ~j~0 := 1 + #t~post2; {4253#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:01,474 INFO L280 TraceCheckUtils]: 55: Hoare triple {4253#(<= main_~j~0 3)} havoc #t~post2; {4253#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:01,475 INFO L280 TraceCheckUtils]: 56: Hoare triple {4253#(<= main_~j~0 3)} assume !!(~j~0 < 8); {4253#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:01,475 INFO L263 TraceCheckUtils]: 57: Hoare triple {4253#(<= main_~j~0 3)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,475 INFO L280 TraceCheckUtils]: 58: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,476 INFO L280 TraceCheckUtils]: 59: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,476 INFO L280 TraceCheckUtils]: 60: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,477 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #71#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:01,477 INFO L263 TraceCheckUtils]: 62: Hoare triple {4253#(<= main_~j~0 3)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,477 INFO L280 TraceCheckUtils]: 63: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,477 INFO L280 TraceCheckUtils]: 64: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,477 INFO L280 TraceCheckUtils]: 65: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,478 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #73#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:01,479 INFO L280 TraceCheckUtils]: 67: Hoare triple {4253#(<= main_~j~0 3)} #t~post2 := ~j~0; {4262#(<= |main_#t~post2| 3)} is VALID [2020-07-08 23:40:01,480 INFO L280 TraceCheckUtils]: 68: Hoare triple {4262#(<= |main_#t~post2| 3)} ~j~0 := 1 + #t~post2; {4263#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:01,480 INFO L280 TraceCheckUtils]: 69: Hoare triple {4263#(<= main_~j~0 4)} havoc #t~post2; {4263#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:01,481 INFO L280 TraceCheckUtils]: 70: Hoare triple {4263#(<= main_~j~0 4)} assume !!(~j~0 < 8); {4263#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:01,481 INFO L263 TraceCheckUtils]: 71: Hoare triple {4263#(<= main_~j~0 4)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,481 INFO L280 TraceCheckUtils]: 72: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,482 INFO L280 TraceCheckUtils]: 73: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,482 INFO L280 TraceCheckUtils]: 74: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,483 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #71#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:01,483 INFO L263 TraceCheckUtils]: 76: Hoare triple {4263#(<= main_~j~0 4)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,483 INFO L280 TraceCheckUtils]: 77: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,483 INFO L280 TraceCheckUtils]: 78: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,483 INFO L280 TraceCheckUtils]: 79: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,484 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #73#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:01,485 INFO L280 TraceCheckUtils]: 81: Hoare triple {4263#(<= main_~j~0 4)} #t~post2 := ~j~0; {4272#(<= |main_#t~post2| 4)} is VALID [2020-07-08 23:40:01,486 INFO L280 TraceCheckUtils]: 82: Hoare triple {4272#(<= |main_#t~post2| 4)} ~j~0 := 1 + #t~post2; {4273#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:01,486 INFO L280 TraceCheckUtils]: 83: Hoare triple {4273#(<= main_~j~0 5)} havoc #t~post2; {4273#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:01,487 INFO L280 TraceCheckUtils]: 84: Hoare triple {4273#(<= main_~j~0 5)} assume !!(~j~0 < 8); {4273#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:01,487 INFO L263 TraceCheckUtils]: 85: Hoare triple {4273#(<= main_~j~0 5)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,487 INFO L280 TraceCheckUtils]: 86: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,487 INFO L280 TraceCheckUtils]: 87: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,487 INFO L280 TraceCheckUtils]: 88: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,488 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #71#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:01,489 INFO L263 TraceCheckUtils]: 90: Hoare triple {4273#(<= main_~j~0 5)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,489 INFO L280 TraceCheckUtils]: 91: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,489 INFO L280 TraceCheckUtils]: 92: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,489 INFO L280 TraceCheckUtils]: 93: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,490 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #73#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:01,491 INFO L280 TraceCheckUtils]: 95: Hoare triple {4273#(<= main_~j~0 5)} #t~post2 := ~j~0; {4282#(<= |main_#t~post2| 5)} is VALID [2020-07-08 23:40:01,491 INFO L280 TraceCheckUtils]: 96: Hoare triple {4282#(<= |main_#t~post2| 5)} ~j~0 := 1 + #t~post2; {4283#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:01,492 INFO L280 TraceCheckUtils]: 97: Hoare triple {4283#(<= main_~j~0 6)} havoc #t~post2; {4283#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:01,493 INFO L280 TraceCheckUtils]: 98: Hoare triple {4283#(<= main_~j~0 6)} assume !(~j~0 < 8); {4220#false} is VALID [2020-07-08 23:40:01,493 INFO L280 TraceCheckUtils]: 99: Hoare triple {4220#false} #t~post1 := ~i~0; {4220#false} is VALID [2020-07-08 23:40:01,493 INFO L280 TraceCheckUtils]: 100: Hoare triple {4220#false} ~i~0 := 1 + #t~post1; {4220#false} is VALID [2020-07-08 23:40:01,493 INFO L280 TraceCheckUtils]: 101: Hoare triple {4220#false} havoc #t~post1; {4220#false} is VALID [2020-07-08 23:40:01,493 INFO L280 TraceCheckUtils]: 102: Hoare triple {4220#false} assume !!(~i~0 < ~nlen~0); {4220#false} is VALID [2020-07-08 23:40:01,494 INFO L280 TraceCheckUtils]: 103: Hoare triple {4220#false} ~j~0 := 0; {4220#false} is VALID [2020-07-08 23:40:01,494 INFO L280 TraceCheckUtils]: 104: Hoare triple {4220#false} assume !!(~j~0 < 8); {4220#false} is VALID [2020-07-08 23:40:01,494 INFO L263 TraceCheckUtils]: 105: Hoare triple {4220#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {4219#true} is VALID [2020-07-08 23:40:01,494 INFO L280 TraceCheckUtils]: 106: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-08 23:40:01,494 INFO L280 TraceCheckUtils]: 107: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-08 23:40:01,494 INFO L280 TraceCheckUtils]: 108: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-08 23:40:01,495 INFO L275 TraceCheckUtils]: 109: Hoare quadruple {4219#true} {4220#false} #71#return; {4220#false} is VALID [2020-07-08 23:40:01,495 INFO L263 TraceCheckUtils]: 110: Hoare triple {4220#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {4220#false} is VALID [2020-07-08 23:40:01,495 INFO L280 TraceCheckUtils]: 111: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2020-07-08 23:40:01,495 INFO L280 TraceCheckUtils]: 112: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2020-07-08 23:40:01,495 INFO L280 TraceCheckUtils]: 113: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2020-07-08 23:40:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 47 proven. 96 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-07-08 23:40:01,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727530031] [2020-07-08 23:40:01,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:01,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-08 23:40:01,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590237998] [2020-07-08 23:40:01,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 114 [2020-07-08 23:40:01,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:01,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 23:40:01,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:01,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 23:40:01,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 23:40:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:40:01,602 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 15 states. [2020-07-08 23:40:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:02,528 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2020-07-08 23:40:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-08 23:40:02,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 114 [2020-07-08 23:40:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:40:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 106 transitions. [2020-07-08 23:40:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:40:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 106 transitions. [2020-07-08 23:40:02,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 106 transitions. [2020-07-08 23:40:02,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:02,680 INFO L225 Difference]: With dead ends: 179 [2020-07-08 23:40:02,680 INFO L226 Difference]: Without dead ends: 127 [2020-07-08 23:40:02,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2020-07-08 23:40:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-08 23:40:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-07-08 23:40:02,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:02,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 119 states. [2020-07-08 23:40:02,906 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 119 states. [2020-07-08 23:40:02,906 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 119 states. [2020-07-08 23:40:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:02,913 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2020-07-08 23:40:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2020-07-08 23:40:02,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:02,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:02,915 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 127 states. [2020-07-08 23:40:02,915 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 127 states. [2020-07-08 23:40:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:02,920 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2020-07-08 23:40:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2020-07-08 23:40:02,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:02,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:02,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:02,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-08 23:40:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2020-07-08 23:40:02,926 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 114 [2020-07-08 23:40:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:02,926 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2020-07-08 23:40:02,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 23:40:02,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 146 transitions. [2020-07-08 23:40:03,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2020-07-08 23:40:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-07-08 23:40:03,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:03,144 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 8, 8, 8, 8, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:03,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:40:03,144 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 724624314, now seen corresponding path program 7 times [2020-07-08 23:40:03,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:03,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [108877279] [2020-07-08 23:40:03,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,408 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5164#true} {5164#true} #67#return; {5164#true} is VALID [2020-07-08 23:40:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,429 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #71#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,436 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #73#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #71#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,448 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #73#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,454 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #71#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,464 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #73#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,470 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #71#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,481 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #73#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #71#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,502 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #73#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,509 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #71#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,517 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #73#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,528 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #71#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,556 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #73#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:03,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5165#false} #71#return; {5165#false} is VALID [2020-07-08 23:40:03,561 INFO L263 TraceCheckUtils]: 0: Hoare triple {5164#true} call ULTIMATE.init(); {5164#true} is VALID [2020-07-08 23:40:03,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5164#true} {5164#true} #67#return; {5164#true} is VALID [2020-07-08 23:40:03,562 INFO L263 TraceCheckUtils]: 3: Hoare triple {5164#true} call #t~ret3 := main(); {5164#true} is VALID [2020-07-08 23:40:03,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {5164#true} havoc ~offset~0; {5164#true} is VALID [2020-07-08 23:40:03,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {5164#true} havoc ~length~0; {5164#true} is VALID [2020-07-08 23:40:03,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {5164#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5164#true} is VALID [2020-07-08 23:40:03,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {5164#true} ~nlen~0 := #t~nondet0; {5164#true} is VALID [2020-07-08 23:40:03,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {5164#true} havoc #t~nondet0; {5164#true} is VALID [2020-07-08 23:40:03,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {5164#true} havoc ~i~0; {5164#true} is VALID [2020-07-08 23:40:03,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {5164#true} havoc ~j~0; {5164#true} is VALID [2020-07-08 23:40:03,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {5164#true} ~i~0 := 0; {5164#true} is VALID [2020-07-08 23:40:03,564 INFO L280 TraceCheckUtils]: 12: Hoare triple {5164#true} assume !!(~i~0 < ~nlen~0); {5164#true} is VALID [2020-07-08 23:40:03,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {5164#true} ~j~0 := 0; {5168#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:03,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {5168#(<= main_~j~0 0)} assume !!(~j~0 < 8); {5168#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:03,566 INFO L263 TraceCheckUtils]: 15: Hoare triple {5168#(<= main_~j~0 0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,566 INFO L280 TraceCheckUtils]: 16: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,567 INFO L280 TraceCheckUtils]: 18: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,568 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #71#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:03,568 INFO L263 TraceCheckUtils]: 20: Hoare triple {5168#(<= main_~j~0 0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,568 INFO L280 TraceCheckUtils]: 21: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,568 INFO L280 TraceCheckUtils]: 22: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,569 INFO L280 TraceCheckUtils]: 23: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,569 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #73#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-08 23:40:03,570 INFO L280 TraceCheckUtils]: 25: Hoare triple {5168#(<= main_~j~0 0)} #t~post2 := ~j~0; {5177#(<= |main_#t~post2| 0)} is VALID [2020-07-08 23:40:03,571 INFO L280 TraceCheckUtils]: 26: Hoare triple {5177#(<= |main_#t~post2| 0)} ~j~0 := 1 + #t~post2; {5178#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:03,571 INFO L280 TraceCheckUtils]: 27: Hoare triple {5178#(<= main_~j~0 1)} havoc #t~post2; {5178#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:03,572 INFO L280 TraceCheckUtils]: 28: Hoare triple {5178#(<= main_~j~0 1)} assume !!(~j~0 < 8); {5178#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:03,572 INFO L263 TraceCheckUtils]: 29: Hoare triple {5178#(<= main_~j~0 1)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,572 INFO L280 TraceCheckUtils]: 30: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,572 INFO L280 TraceCheckUtils]: 31: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,572 INFO L280 TraceCheckUtils]: 32: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,573 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #71#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:03,573 INFO L263 TraceCheckUtils]: 34: Hoare triple {5178#(<= main_~j~0 1)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,574 INFO L280 TraceCheckUtils]: 35: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,574 INFO L280 TraceCheckUtils]: 36: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,574 INFO L280 TraceCheckUtils]: 37: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,575 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #73#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-08 23:40:03,575 INFO L280 TraceCheckUtils]: 39: Hoare triple {5178#(<= main_~j~0 1)} #t~post2 := ~j~0; {5187#(<= |main_#t~post2| 1)} is VALID [2020-07-08 23:40:03,576 INFO L280 TraceCheckUtils]: 40: Hoare triple {5187#(<= |main_#t~post2| 1)} ~j~0 := 1 + #t~post2; {5188#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:03,576 INFO L280 TraceCheckUtils]: 41: Hoare triple {5188#(<= main_~j~0 2)} havoc #t~post2; {5188#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:03,577 INFO L280 TraceCheckUtils]: 42: Hoare triple {5188#(<= main_~j~0 2)} assume !!(~j~0 < 8); {5188#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:03,577 INFO L263 TraceCheckUtils]: 43: Hoare triple {5188#(<= main_~j~0 2)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,577 INFO L280 TraceCheckUtils]: 44: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,578 INFO L280 TraceCheckUtils]: 45: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,578 INFO L280 TraceCheckUtils]: 46: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,579 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #71#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:03,579 INFO L263 TraceCheckUtils]: 48: Hoare triple {5188#(<= main_~j~0 2)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,579 INFO L280 TraceCheckUtils]: 49: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,579 INFO L280 TraceCheckUtils]: 50: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,579 INFO L280 TraceCheckUtils]: 51: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,580 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #73#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-08 23:40:03,581 INFO L280 TraceCheckUtils]: 53: Hoare triple {5188#(<= main_~j~0 2)} #t~post2 := ~j~0; {5197#(<= |main_#t~post2| 2)} is VALID [2020-07-08 23:40:03,582 INFO L280 TraceCheckUtils]: 54: Hoare triple {5197#(<= |main_#t~post2| 2)} ~j~0 := 1 + #t~post2; {5198#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:03,582 INFO L280 TraceCheckUtils]: 55: Hoare triple {5198#(<= main_~j~0 3)} havoc #t~post2; {5198#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:03,583 INFO L280 TraceCheckUtils]: 56: Hoare triple {5198#(<= main_~j~0 3)} assume !!(~j~0 < 8); {5198#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:03,583 INFO L263 TraceCheckUtils]: 57: Hoare triple {5198#(<= main_~j~0 3)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,583 INFO L280 TraceCheckUtils]: 58: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,583 INFO L280 TraceCheckUtils]: 59: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,584 INFO L280 TraceCheckUtils]: 60: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,584 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #71#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:03,584 INFO L263 TraceCheckUtils]: 62: Hoare triple {5198#(<= main_~j~0 3)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,585 INFO L280 TraceCheckUtils]: 63: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,585 INFO L280 TraceCheckUtils]: 64: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,585 INFO L280 TraceCheckUtils]: 65: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,586 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #73#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-08 23:40:03,586 INFO L280 TraceCheckUtils]: 67: Hoare triple {5198#(<= main_~j~0 3)} #t~post2 := ~j~0; {5207#(<= |main_#t~post2| 3)} is VALID [2020-07-08 23:40:03,587 INFO L280 TraceCheckUtils]: 68: Hoare triple {5207#(<= |main_#t~post2| 3)} ~j~0 := 1 + #t~post2; {5208#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:03,588 INFO L280 TraceCheckUtils]: 69: Hoare triple {5208#(<= main_~j~0 4)} havoc #t~post2; {5208#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:03,588 INFO L280 TraceCheckUtils]: 70: Hoare triple {5208#(<= main_~j~0 4)} assume !!(~j~0 < 8); {5208#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:03,588 INFO L263 TraceCheckUtils]: 71: Hoare triple {5208#(<= main_~j~0 4)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,589 INFO L280 TraceCheckUtils]: 72: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,589 INFO L280 TraceCheckUtils]: 73: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,589 INFO L280 TraceCheckUtils]: 74: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,590 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #71#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:03,590 INFO L263 TraceCheckUtils]: 76: Hoare triple {5208#(<= main_~j~0 4)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,591 INFO L280 TraceCheckUtils]: 77: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,591 INFO L280 TraceCheckUtils]: 78: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,591 INFO L280 TraceCheckUtils]: 79: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,592 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #73#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-08 23:40:03,593 INFO L280 TraceCheckUtils]: 81: Hoare triple {5208#(<= main_~j~0 4)} #t~post2 := ~j~0; {5217#(<= |main_#t~post2| 4)} is VALID [2020-07-08 23:40:03,593 INFO L280 TraceCheckUtils]: 82: Hoare triple {5217#(<= |main_#t~post2| 4)} ~j~0 := 1 + #t~post2; {5218#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:03,594 INFO L280 TraceCheckUtils]: 83: Hoare triple {5218#(<= main_~j~0 5)} havoc #t~post2; {5218#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:03,595 INFO L280 TraceCheckUtils]: 84: Hoare triple {5218#(<= main_~j~0 5)} assume !!(~j~0 < 8); {5218#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:03,595 INFO L263 TraceCheckUtils]: 85: Hoare triple {5218#(<= main_~j~0 5)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,595 INFO L280 TraceCheckUtils]: 86: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,596 INFO L280 TraceCheckUtils]: 87: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,596 INFO L280 TraceCheckUtils]: 88: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,597 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #71#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:03,597 INFO L263 TraceCheckUtils]: 90: Hoare triple {5218#(<= main_~j~0 5)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,597 INFO L280 TraceCheckUtils]: 91: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,598 INFO L280 TraceCheckUtils]: 92: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,598 INFO L280 TraceCheckUtils]: 93: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,599 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #73#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-08 23:40:03,599 INFO L280 TraceCheckUtils]: 95: Hoare triple {5218#(<= main_~j~0 5)} #t~post2 := ~j~0; {5227#(<= |main_#t~post2| 5)} is VALID [2020-07-08 23:40:03,600 INFO L280 TraceCheckUtils]: 96: Hoare triple {5227#(<= |main_#t~post2| 5)} ~j~0 := 1 + #t~post2; {5228#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:03,601 INFO L280 TraceCheckUtils]: 97: Hoare triple {5228#(<= main_~j~0 6)} havoc #t~post2; {5228#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:03,602 INFO L280 TraceCheckUtils]: 98: Hoare triple {5228#(<= main_~j~0 6)} assume !!(~j~0 < 8); {5228#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:03,602 INFO L263 TraceCheckUtils]: 99: Hoare triple {5228#(<= main_~j~0 6)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,602 INFO L280 TraceCheckUtils]: 100: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,602 INFO L280 TraceCheckUtils]: 101: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,603 INFO L280 TraceCheckUtils]: 102: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,604 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #71#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:03,604 INFO L263 TraceCheckUtils]: 104: Hoare triple {5228#(<= main_~j~0 6)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,604 INFO L280 TraceCheckUtils]: 105: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,605 INFO L280 TraceCheckUtils]: 106: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,605 INFO L280 TraceCheckUtils]: 107: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,606 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #73#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-08 23:40:03,607 INFO L280 TraceCheckUtils]: 109: Hoare triple {5228#(<= main_~j~0 6)} #t~post2 := ~j~0; {5237#(<= |main_#t~post2| 6)} is VALID [2020-07-08 23:40:03,608 INFO L280 TraceCheckUtils]: 110: Hoare triple {5237#(<= |main_#t~post2| 6)} ~j~0 := 1 + #t~post2; {5238#(<= main_~j~0 7)} is VALID [2020-07-08 23:40:03,608 INFO L280 TraceCheckUtils]: 111: Hoare triple {5238#(<= main_~j~0 7)} havoc #t~post2; {5238#(<= main_~j~0 7)} is VALID [2020-07-08 23:40:03,609 INFO L280 TraceCheckUtils]: 112: Hoare triple {5238#(<= main_~j~0 7)} assume !(~j~0 < 8); {5165#false} is VALID [2020-07-08 23:40:03,609 INFO L280 TraceCheckUtils]: 113: Hoare triple {5165#false} #t~post1 := ~i~0; {5165#false} is VALID [2020-07-08 23:40:03,609 INFO L280 TraceCheckUtils]: 114: Hoare triple {5165#false} ~i~0 := 1 + #t~post1; {5165#false} is VALID [2020-07-08 23:40:03,610 INFO L280 TraceCheckUtils]: 115: Hoare triple {5165#false} havoc #t~post1; {5165#false} is VALID [2020-07-08 23:40:03,610 INFO L280 TraceCheckUtils]: 116: Hoare triple {5165#false} assume !!(~i~0 < ~nlen~0); {5165#false} is VALID [2020-07-08 23:40:03,610 INFO L280 TraceCheckUtils]: 117: Hoare triple {5165#false} ~j~0 := 0; {5165#false} is VALID [2020-07-08 23:40:03,610 INFO L280 TraceCheckUtils]: 118: Hoare triple {5165#false} assume !!(~j~0 < 8); {5165#false} is VALID [2020-07-08 23:40:03,610 INFO L263 TraceCheckUtils]: 119: Hoare triple {5165#false} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {5164#true} is VALID [2020-07-08 23:40:03,611 INFO L280 TraceCheckUtils]: 120: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-08 23:40:03,611 INFO L280 TraceCheckUtils]: 121: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-08 23:40:03,611 INFO L280 TraceCheckUtils]: 122: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-08 23:40:03,611 INFO L275 TraceCheckUtils]: 123: Hoare quadruple {5164#true} {5165#false} #71#return; {5165#false} is VALID [2020-07-08 23:40:03,611 INFO L263 TraceCheckUtils]: 124: Hoare triple {5165#false} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {5165#false} is VALID [2020-07-08 23:40:03,611 INFO L280 TraceCheckUtils]: 125: Hoare triple {5165#false} ~cond := #in~cond; {5165#false} is VALID [2020-07-08 23:40:03,612 INFO L280 TraceCheckUtils]: 126: Hoare triple {5165#false} assume 0 == ~cond; {5165#false} is VALID [2020-07-08 23:40:03,612 INFO L280 TraceCheckUtils]: 127: Hoare triple {5165#false} assume !false; {5165#false} is VALID [2020-07-08 23:40:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 54 proven. 133 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-07-08 23:40:03,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [108877279] [2020-07-08 23:40:03,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:40:03,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-08 23:40:03,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137733646] [2020-07-08 23:40:03,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2020-07-08 23:40:03,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:03,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 23:40:03,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:03,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 23:40:03,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 23:40:03,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-08 23:40:03,754 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand 17 states. [2020-07-08 23:40:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:04,656 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2020-07-08 23:40:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-08 23:40:04,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2020-07-08 23:40:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:40:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2020-07-08 23:40:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:40:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2020-07-08 23:40:04,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 108 transitions. [2020-07-08 23:40:04,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:04,774 INFO L225 Difference]: With dead ends: 189 [2020-07-08 23:40:04,774 INFO L226 Difference]: Without dead ends: 131 [2020-07-08 23:40:04,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2020-07-08 23:40:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-07-08 23:40:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-07-08 23:40:05,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:05,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 131 states. [2020-07-08 23:40:05,074 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 131 states. [2020-07-08 23:40:05,074 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 131 states. [2020-07-08 23:40:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:05,080 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2020-07-08 23:40:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2020-07-08 23:40:05,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:05,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:05,082 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 131 states. [2020-07-08 23:40:05,082 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 131 states. [2020-07-08 23:40:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:05,103 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2020-07-08 23:40:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2020-07-08 23:40:05,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:05,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:05,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:05,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-08 23:40:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2020-07-08 23:40:05,110 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 128 [2020-07-08 23:40:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:05,110 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2020-07-08 23:40:05,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 23:40:05,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 131 states and 162 transitions. [2020-07-08 23:40:05,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2020-07-08 23:40:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-08 23:40:05,320 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:40:05,320 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:40:05,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 23:40:05,321 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:40:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:40:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1386163675, now seen corresponding path program 8 times [2020-07-08 23:40:05,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:40:05,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137622965] [2020-07-08 23:40:05,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:40:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,552 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6175#true} {6175#true} #67#return; {6175#true} is VALID [2020-07-08 23:40:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,560 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,578 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,586 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,593 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,601 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,611 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,617 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,627 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,637 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,645 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,651 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,656 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,670 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,677 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:40:05,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,684 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6245#(<= 1 main_~i~0)} #71#return; {6245#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:05,685 INFO L263 TraceCheckUtils]: 0: Hoare triple {6175#true} call ULTIMATE.init(); {6175#true} is VALID [2020-07-08 23:40:05,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,685 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6175#true} {6175#true} #67#return; {6175#true} is VALID [2020-07-08 23:40:05,686 INFO L263 TraceCheckUtils]: 3: Hoare triple {6175#true} call #t~ret3 := main(); {6175#true} is VALID [2020-07-08 23:40:05,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {6175#true} havoc ~offset~0; {6175#true} is VALID [2020-07-08 23:40:05,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {6175#true} havoc ~length~0; {6175#true} is VALID [2020-07-08 23:40:05,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {6175#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6175#true} is VALID [2020-07-08 23:40:05,687 INFO L280 TraceCheckUtils]: 7: Hoare triple {6175#true} ~nlen~0 := #t~nondet0; {6175#true} is VALID [2020-07-08 23:40:05,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {6175#true} havoc #t~nondet0; {6175#true} is VALID [2020-07-08 23:40:05,688 INFO L280 TraceCheckUtils]: 9: Hoare triple {6175#true} havoc ~i~0; {6175#true} is VALID [2020-07-08 23:40:05,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {6175#true} havoc ~j~0; {6175#true} is VALID [2020-07-08 23:40:05,689 INFO L280 TraceCheckUtils]: 11: Hoare triple {6175#true} ~i~0 := 0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,689 INFO L280 TraceCheckUtils]: 12: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~i~0 < ~nlen~0); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,690 INFO L280 TraceCheckUtils]: 13: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,691 INFO L263 TraceCheckUtils]: 15: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,691 INFO L280 TraceCheckUtils]: 16: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,691 INFO L280 TraceCheckUtils]: 17: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,691 INFO L280 TraceCheckUtils]: 18: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,692 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,692 INFO L263 TraceCheckUtils]: 20: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,693 INFO L280 TraceCheckUtils]: 21: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,693 INFO L280 TraceCheckUtils]: 22: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,693 INFO L280 TraceCheckUtils]: 23: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,694 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,694 INFO L280 TraceCheckUtils]: 25: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,695 INFO L280 TraceCheckUtils]: 26: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,695 INFO L280 TraceCheckUtils]: 27: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,696 INFO L280 TraceCheckUtils]: 28: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,696 INFO L263 TraceCheckUtils]: 29: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,696 INFO L280 TraceCheckUtils]: 30: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,696 INFO L280 TraceCheckUtils]: 31: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,697 INFO L280 TraceCheckUtils]: 32: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,697 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,698 INFO L263 TraceCheckUtils]: 34: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,698 INFO L280 TraceCheckUtils]: 35: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,698 INFO L280 TraceCheckUtils]: 36: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,698 INFO L280 TraceCheckUtils]: 37: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,699 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,699 INFO L280 TraceCheckUtils]: 39: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,700 INFO L280 TraceCheckUtils]: 40: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,701 INFO L280 TraceCheckUtils]: 41: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,702 INFO L280 TraceCheckUtils]: 42: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,702 INFO L263 TraceCheckUtils]: 43: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,702 INFO L280 TraceCheckUtils]: 44: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,703 INFO L280 TraceCheckUtils]: 45: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,703 INFO L280 TraceCheckUtils]: 46: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,704 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,704 INFO L263 TraceCheckUtils]: 48: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,705 INFO L280 TraceCheckUtils]: 49: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,705 INFO L280 TraceCheckUtils]: 50: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,705 INFO L280 TraceCheckUtils]: 51: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,707 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,708 INFO L280 TraceCheckUtils]: 53: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,708 INFO L280 TraceCheckUtils]: 54: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,709 INFO L280 TraceCheckUtils]: 55: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,710 INFO L280 TraceCheckUtils]: 56: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,710 INFO L263 TraceCheckUtils]: 57: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,710 INFO L280 TraceCheckUtils]: 58: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,711 INFO L280 TraceCheckUtils]: 59: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,711 INFO L280 TraceCheckUtils]: 60: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,712 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,712 INFO L263 TraceCheckUtils]: 62: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,713 INFO L280 TraceCheckUtils]: 63: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,713 INFO L280 TraceCheckUtils]: 64: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,713 INFO L280 TraceCheckUtils]: 65: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,714 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,715 INFO L280 TraceCheckUtils]: 67: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,716 INFO L280 TraceCheckUtils]: 68: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,716 INFO L280 TraceCheckUtils]: 69: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,717 INFO L280 TraceCheckUtils]: 70: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,717 INFO L263 TraceCheckUtils]: 71: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,718 INFO L280 TraceCheckUtils]: 72: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,718 INFO L280 TraceCheckUtils]: 73: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,718 INFO L280 TraceCheckUtils]: 74: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,719 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,719 INFO L263 TraceCheckUtils]: 76: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,720 INFO L280 TraceCheckUtils]: 77: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,720 INFO L280 TraceCheckUtils]: 78: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,720 INFO L280 TraceCheckUtils]: 79: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,721 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,722 INFO L280 TraceCheckUtils]: 81: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,722 INFO L280 TraceCheckUtils]: 82: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,723 INFO L280 TraceCheckUtils]: 83: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,724 INFO L280 TraceCheckUtils]: 84: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,724 INFO L263 TraceCheckUtils]: 85: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,724 INFO L280 TraceCheckUtils]: 86: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,724 INFO L280 TraceCheckUtils]: 87: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,724 INFO L280 TraceCheckUtils]: 88: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,725 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,725 INFO L263 TraceCheckUtils]: 90: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,726 INFO L280 TraceCheckUtils]: 91: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,726 INFO L280 TraceCheckUtils]: 92: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,726 INFO L280 TraceCheckUtils]: 93: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,727 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,727 INFO L280 TraceCheckUtils]: 95: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,728 INFO L280 TraceCheckUtils]: 96: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,728 INFO L280 TraceCheckUtils]: 97: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,729 INFO L280 TraceCheckUtils]: 98: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,729 INFO L263 TraceCheckUtils]: 99: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,729 INFO L280 TraceCheckUtils]: 100: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,729 INFO L280 TraceCheckUtils]: 101: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,730 INFO L280 TraceCheckUtils]: 102: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,731 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,731 INFO L263 TraceCheckUtils]: 104: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,731 INFO L280 TraceCheckUtils]: 105: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,732 INFO L280 TraceCheckUtils]: 106: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,732 INFO L280 TraceCheckUtils]: 107: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,733 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,733 INFO L280 TraceCheckUtils]: 109: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,734 INFO L280 TraceCheckUtils]: 110: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,735 INFO L280 TraceCheckUtils]: 111: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,735 INFO L280 TraceCheckUtils]: 112: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,736 INFO L263 TraceCheckUtils]: 113: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,736 INFO L280 TraceCheckUtils]: 114: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,736 INFO L280 TraceCheckUtils]: 115: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,736 INFO L280 TraceCheckUtils]: 116: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,737 INFO L275 TraceCheckUtils]: 117: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,737 INFO L263 TraceCheckUtils]: 118: Hoare triple {6179#(<= 0 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,737 INFO L280 TraceCheckUtils]: 119: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,737 INFO L280 TraceCheckUtils]: 120: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,737 INFO L280 TraceCheckUtils]: 121: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,738 INFO L275 TraceCheckUtils]: 122: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,738 INFO L280 TraceCheckUtils]: 123: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,739 INFO L280 TraceCheckUtils]: 124: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 1 + #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,739 INFO L280 TraceCheckUtils]: 125: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,740 INFO L280 TraceCheckUtils]: 126: Hoare triple {6179#(<= 0 main_~i~0)} assume !(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-08 23:40:05,741 INFO L280 TraceCheckUtils]: 127: Hoare triple {6179#(<= 0 main_~i~0)} #t~post1 := ~i~0; {6244#(<= 0 |main_#t~post1|)} is VALID [2020-07-08 23:40:05,741 INFO L280 TraceCheckUtils]: 128: Hoare triple {6244#(<= 0 |main_#t~post1|)} ~i~0 := 1 + #t~post1; {6245#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:05,742 INFO L280 TraceCheckUtils]: 129: Hoare triple {6245#(<= 1 main_~i~0)} havoc #t~post1; {6245#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:05,742 INFO L280 TraceCheckUtils]: 130: Hoare triple {6245#(<= 1 main_~i~0)} assume !!(~i~0 < ~nlen~0); {6245#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:05,743 INFO L280 TraceCheckUtils]: 131: Hoare triple {6245#(<= 1 main_~i~0)} ~j~0 := 0; {6246#(and (= 0 main_~j~0) (<= 1 main_~i~0))} is VALID [2020-07-08 23:40:05,744 INFO L280 TraceCheckUtils]: 132: Hoare triple {6246#(and (= 0 main_~j~0) (<= 1 main_~i~0))} assume !!(~j~0 < 8); {6245#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:05,744 INFO L263 TraceCheckUtils]: 133: Hoare triple {6245#(<= 1 main_~i~0)} call __VERIFIER_assert((if 0 <= ~nlen~0 - 1 - ~i~0 then 1 else 0)); {6175#true} is VALID [2020-07-08 23:40:05,744 INFO L280 TraceCheckUtils]: 134: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-08 23:40:05,744 INFO L280 TraceCheckUtils]: 135: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-08 23:40:05,744 INFO L280 TraceCheckUtils]: 136: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-08 23:40:05,745 INFO L275 TraceCheckUtils]: 137: Hoare quadruple {6175#true} {6245#(<= 1 main_~i~0)} #71#return; {6245#(<= 1 main_~i~0)} is VALID [2020-07-08 23:40:05,746 INFO L263 TraceCheckUtils]: 138: Hoare triple {6245#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~nlen~0 - 1 - ~i~0 < ~nlen~0 then 1 else 0)); {6251#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:40:05,747 INFO L280 TraceCheckUtils]: 139: Hoare triple {6251#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6252#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:40:05,747 INFO L280 TraceCheckUtils]: 140: Hoare triple {6252#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6176#false} is VALID [2020-07-08 23:40:05,747 INFO L280 TraceCheckUtils]: 141: Hoare triple {6176#false} assume !false; {6176#false} is VALID [2020-07-08 23:40:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2020-07-08 23:40:05,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137622965] [2020-07-08 23:40:05,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:40:05,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:40:05,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168845353] [2020-07-08 23:40:05,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2020-07-08 23:40:05,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:40:05,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:40:05,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:05,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:40:05,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:40:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:40:05,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:40:05,812 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 8 states. [2020-07-08 23:40:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:06,445 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2020-07-08 23:40:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 23:40:06,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2020-07-08 23:40:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:40:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2020-07-08 23:40:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:40:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2020-07-08 23:40:06,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2020-07-08 23:40:06,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:06,514 INFO L225 Difference]: With dead ends: 133 [2020-07-08 23:40:06,514 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:40:06,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:40:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:40:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:40:06,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:40:06,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:06,517 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:06,517 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:06,517 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:06,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:06,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:06,518 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:06,518 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:40:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:40:06,518 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:40:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:06,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:06,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:40:06,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:40:06,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:40:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:40:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:40:06,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-08 23:40:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:40:06,521 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:40:06,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:40:06,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:40:06,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:40:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:40:06,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:40:06,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 23:40:06,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:40:07,737 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 12 [2020-07-08 23:40:07,903 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 12 [2020-07-08 23:40:08,204 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 12 [2020-07-08 23:40:08,462 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 12 [2020-07-08 23:40:08,514 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:08,514 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:08,514 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:40:08,514 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:40:08,515 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:40:08,515 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:40:08,515 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:08,515 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:08,516 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 23:40:08,516 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 23:40:08,516 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:40:08,516 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 23) the Hoare annotation is: true [2020-07-08 23:40:08,517 INFO L264 CegarLoopResult]: At program point L19(lines 17 20) the Hoare annotation is: (and (<= main_~j~0 7) (< main_~i~0 main_~nlen~0) (< 0 (+ main_~i~0 1))) [2020-07-08 23:40:08,517 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (< main_~i~0 main_~nlen~0) (< 0 (+ main_~i~0 1))) [2020-07-08 23:40:08,517 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 23:40:08,517 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-08 23:40:08,519 INFO L264 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (and (<= main_~j~0 7) (< main_~i~0 main_~nlen~0) (< 0 (+ main_~i~0 1))) [2020-07-08 23:40:08,519 INFO L264 CegarLoopResult]: At program point L17-4(line 17) the Hoare annotation is: (and (< main_~i~0 main_~nlen~0) (< 0 (+ main_~i~0 1))) [2020-07-08 23:40:08,520 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 23) the Hoare annotation is: true [2020-07-08 23:40:08,520 INFO L264 CegarLoopResult]: At program point L17-5(lines 17 20) the Hoare annotation is: (and (< main_~i~0 main_~nlen~0) (< 0 (+ main_~i~0 1))) [2020-07-08 23:40:08,520 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2020-07-08 23:40:08,520 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= main_~j~0 7) (< main_~i~0 main_~nlen~0) (< 0 (+ main_~i~0 1))) [2020-07-08 23:40:08,520 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (and (<= main_~j~0 7) (< main_~i~0 main_~nlen~0) (< 0 (+ main_~i~0 1))) [2020-07-08 23:40:08,520 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 23:40:08,520 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-08 23:40:08,521 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-08 23:40:08,521 INFO L264 CegarLoopResult]: At program point L16-3(lines 16 21) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~i~0 main_~nlen~0)) [2020-07-08 23:40:08,521 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-08 23:40:08,521 INFO L264 CegarLoopResult]: At program point L16-4(line 16) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~i~0 main_~nlen~0) (<= 0 |main_#t~post1|)) [2020-07-08 23:40:08,525 INFO L271 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: true [2020-07-08 23:40:08,525 INFO L264 CegarLoopResult]: At program point L16-5(line 16) the Hoare annotation is: (and (<= 0 |main_#t~post1|) (<= 1 main_~i~0)) [2020-07-08 23:40:08,525 INFO L264 CegarLoopResult]: At program point L16-6(lines 16 21) the Hoare annotation is: (< 0 (+ main_~i~0 1)) [2020-07-08 23:40:08,525 INFO L271 CegarLoopResult]: At program point L16-7(lines 16 21) the Hoare annotation is: true [2020-07-08 23:40:08,525 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 23:40:08,525 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:40:08,526 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:08,526 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:40:08,526 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:40:08,526 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:40:08,533 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:40:08,534 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:08,535 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:40:08,540 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 23:40:08,540 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 23:40:08,549 INFO L163 areAnnotationChecker]: CFG has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:40:08,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:40:08 BoogieIcfgContainer [2020-07-08 23:40:08,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:40:08,575 INFO L168 Benchmark]: Toolchain (without parser) took 16664.05 ms. Allocated memory was 135.8 MB in the beginning and 402.7 MB in the end (delta: 266.9 MB). Free memory was 101.5 MB in the beginning and 348.8 MB in the end (delta: -247.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:08,584 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 23:40:08,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.10 ms. Allocated memory is still 135.8 MB. Free memory was 101.3 MB in the beginning and 91.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:08,586 INFO L168 Benchmark]: Boogie Preprocessor took 48.93 ms. Allocated memory is still 135.8 MB. Free memory was 91.5 MB in the beginning and 90.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:08,587 INFO L168 Benchmark]: RCFGBuilder took 492.69 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.9 MB in the beginning and 160.6 MB in the end (delta: -70.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:08,588 INFO L168 Benchmark]: TraceAbstraction took 15861.88 ms. Allocated memory was 200.3 MB in the beginning and 402.7 MB in the end (delta: 202.4 MB). Free memory was 159.9 MB in the beginning and 348.8 MB in the end (delta: -188.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:40:08,595 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.10 ms. Allocated memory is still 135.8 MB. Free memory was 101.3 MB in the beginning and 91.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.93 ms. Allocated memory is still 135.8 MB. Free memory was 91.5 MB in the beginning and 90.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 492.69 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.9 MB in the beginning and 160.6 MB in the end (delta: -70.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15861.88 ms. Allocated memory was 200.3 MB in the beginning and 402.7 MB in the end (delta: 202.4 MB). Free memory was 159.9 MB in the beginning and 348.8 MB in the end (delta: -188.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: i < nlen && 0 < i + 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 < i + 1 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.7s, OverallIterations: 11, TraceHistogramMax: 18, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 392 SDtfs, 137 SDslu, 1160 SDs, 0 SdLazy, 441 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 580 PreInvPairs, 756 NumberOfFragments, 152 HoareAnnotationTreeSize, 580 FomulaSimplifications, 21632 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 34 FomulaSimplificationsInter, 10429 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 131012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 2251/2615 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...