/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-8fc6572 [2020-07-11 02:31:03,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:31:03,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:31:03,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:31:03,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:31:03,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:31:03,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:31:03,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:31:03,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:31:03,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:31:03,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:31:03,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:31:03,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:31:03,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:31:03,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:31:03,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:31:03,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:31:03,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:31:03,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:31:03,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:31:03,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:31:03,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:31:03,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:31:03,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:31:03,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:31:03,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:31:03,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:31:03,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:31:03,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:31:03,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:31:03,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:31:03,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:31:03,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:31:03,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:31:03,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:31:03,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:31:03,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:31:03,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:31:03,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:31:03,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:31:03,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:31:03,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:31:03,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:31:03,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:31:03,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:31:03,886 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:31:03,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:31:03,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:31:03,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:31:03,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:31:03,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:31:03,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:31:03,888 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:31:03,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:31:03,888 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:31:03,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:31:03,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:31:03,889 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:31:03,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:31:03,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:31:03,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:03,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:31:03,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:31:03,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:31:03,890 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-11 02:31:04,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:31:04,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:31:04,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:31:04,193 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:31:04,193 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:31:04,194 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-11 02:31:04,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a295f5f75/2bd2cde77c5941eabee4f0a972526297/FLAGe169174a5 [2020-07-11 02:31:04,703 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:31:04,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i [2020-07-11 02:31:04,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a295f5f75/2bd2cde77c5941eabee4f0a972526297/FLAGe169174a5 [2020-07-11 02:31:05,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a295f5f75/2bd2cde77c5941eabee4f0a972526297 [2020-07-11 02:31:05,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:31:05,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:31:05,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:05,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:31:05,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:31:05,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f89a8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05, skipping insertion in model container [2020-07-11 02:31:05,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:31:05,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:31:05,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:05,363 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:31:05,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:05,395 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:31:05,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05 WrapperNode [2020-07-11 02:31:05,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:05,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:31:05,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:31:05,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:31:05,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (1/1) ... [2020-07-11 02:31:05,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:31:05,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:31:05,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:31:05,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:31:05,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (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-11 02:31:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:31:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:31:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:31:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:31:05,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:31:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:31:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:31:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:31:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:31:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:31:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:31:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:31:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:31:05,866 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:31:05,866 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 02:31:05,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:05 BoogieIcfgContainer [2020-07-11 02:31:05,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:31:05,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:31:05,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:31:05,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:31:05,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:31:05" (1/3) ... [2020-07-11 02:31:05,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18858b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:05, skipping insertion in model container [2020-07-11 02:31:05,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:05" (2/3) ... [2020-07-11 02:31:05,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18858b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:05, skipping insertion in model container [2020-07-11 02:31:05,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:05" (3/3) ... [2020-07-11 02:31:05,892 INFO L109 eAbstractionObserver]: Analyzing ICFG id_build.i [2020-07-11 02:31:05,914 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:31:05,933 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:31:05,944 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:31:05,963 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:31:05,964 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:31:05,964 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:31:05,964 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:31:05,964 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:31:05,964 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:31:05,965 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:31:05,965 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:31:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-11 02:31:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-11 02:31:05,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:05,987 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-11 02:31:05,988 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2141903635, now seen corresponding path program 1 times [2020-07-11 02:31:06,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:06,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074035699] [2020-07-11 02:31:06,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:06,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-11 02:31:06,233 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #67#return; {37#true} is VALID [2020-07-11 02:31:06,235 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-11 02:31:06,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-11 02:31:06,236 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #67#return; {37#true} is VALID [2020-07-11 02:31:06,237 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-11 02:31:06,237 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} havoc ~offset~0; {37#true} is VALID [2020-07-11 02:31:06,237 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~length~0; {37#true} is VALID [2020-07-11 02:31:06,238 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {37#true} is VALID [2020-07-11 02:31:06,238 INFO L280 TraceCheckUtils]: 7: Hoare triple {37#true} ~nlen~0 := #t~nondet0; {37#true} is VALID [2020-07-11 02:31:06,238 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} havoc #t~nondet0; {37#true} is VALID [2020-07-11 02:31:06,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} havoc ~i~0; {37#true} is VALID [2020-07-11 02:31:06,239 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#true} havoc ~j~0; {37#true} is VALID [2020-07-11 02:31:06,240 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#true} ~i~0 := 0; {37#true} is VALID [2020-07-11 02:31:06,242 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#true} assume !!(~i~0 < ~nlen~0); {41#(< main_~i~0 main_~nlen~0)} is VALID [2020-07-11 02:31:06,244 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-11 02:31:06,244 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-11 02:31:06,246 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-11 02:31:06,248 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-11 02:31:06,249 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {38#false} is VALID [2020-07-11 02:31:06,249 INFO L280 TraceCheckUtils]: 18: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-11 02:31:06,252 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-11 02:31:06,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074035699] [2020-07-11 02:31:06,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:06,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:31:06,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113113613] [2020-07-11 02:31:06,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-11 02:31:06,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:06,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:31:06,318 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-11 02:31:06,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:31:06,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:06,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:31:06,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:31:06,330 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-11 02:31:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:06,616 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2020-07-11 02:31:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:31:06,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-11 02:31:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-11 02:31:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-11 02:31:06,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2020-07-11 02:31:06,744 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-11 02:31:06,758 INFO L225 Difference]: With dead ends: 60 [2020-07-11 02:31:06,758 INFO L226 Difference]: Without dead ends: 33 [2020-07-11 02:31:06,762 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-11 02:31:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-11 02:31:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-11 02:31:06,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:06,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-11 02:31:06,853 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 02:31:06,853 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 02:31:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:06,858 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-11 02:31:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 02:31:06,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:06,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:06,859 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 02:31:06,860 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 02:31:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:06,864 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-11 02:31:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 02:31:06,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:06,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:06,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:06,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-11 02:31:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-11 02:31:06,870 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 19 [2020-07-11 02:31:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:06,871 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-11 02:31:06,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:31:06,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-11 02:31:06,916 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-11 02:31:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 02:31:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:31:06,918 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:06,918 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-11 02:31:06,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:31:06,919 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:06,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:06,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1520201371, now seen corresponding path program 1 times [2020-07-11 02:31:06,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:06,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267136287] [2020-07-11 02:31:06,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-11 02:31:07,014 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {300#true} {300#true} #67#return; {300#true} is VALID [2020-07-11 02:31:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#true} ~cond := #in~cond; {300#true} is VALID [2020-07-11 02:31:07,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#true} assume !(0 == ~cond); {300#true} is VALID [2020-07-11 02:31:07,027 INFO L280 TraceCheckUtils]: 2: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-11 02:31:07,028 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-11 02:31:07,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {300#true} is VALID [2020-07-11 02:31:07,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-11 02:31:07,029 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #67#return; {300#true} is VALID [2020-07-11 02:31:07,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {300#true} call #t~ret3 := main(); {300#true} is VALID [2020-07-11 02:31:07,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {300#true} havoc ~offset~0; {300#true} is VALID [2020-07-11 02:31:07,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {300#true} havoc ~length~0; {300#true} is VALID [2020-07-11 02:31:07,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {300#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {300#true} is VALID [2020-07-11 02:31:07,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#true} ~nlen~0 := #t~nondet0; {300#true} is VALID [2020-07-11 02:31:07,031 INFO L280 TraceCheckUtils]: 8: Hoare triple {300#true} havoc #t~nondet0; {300#true} is VALID [2020-07-11 02:31:07,031 INFO L280 TraceCheckUtils]: 9: Hoare triple {300#true} havoc ~i~0; {300#true} is VALID [2020-07-11 02:31:07,031 INFO L280 TraceCheckUtils]: 10: Hoare triple {300#true} havoc ~j~0; {300#true} is VALID [2020-07-11 02:31:07,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {300#true} ~i~0 := 0; {304#(< 0 (+ main_~i~0 1))} is VALID [2020-07-11 02:31:07,033 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-11 02:31:07,034 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-11 02:31:07,034 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-11 02:31:07,035 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-11 02:31:07,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {300#true} ~cond := #in~cond; {300#true} is VALID [2020-07-11 02:31:07,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {300#true} assume !(0 == ~cond); {300#true} is VALID [2020-07-11 02:31:07,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-11 02:31:07,037 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-11 02:31:07,038 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-11 02:31:07,039 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-11 02:31:07,039 INFO L280 TraceCheckUtils]: 22: Hoare triple {310#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {301#false} is VALID [2020-07-11 02:31:07,040 INFO L280 TraceCheckUtils]: 23: Hoare triple {301#false} assume !false; {301#false} is VALID [2020-07-11 02:31:07,042 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-11 02:31:07,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267136287] [2020-07-11 02:31:07,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:07,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:31:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121033550] [2020-07-11 02:31:07,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-11 02:31:07,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:07,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:31:07,073 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-11 02:31:07,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:31:07,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:31:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:31:07,075 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 5 states. [2020-07-11 02:31:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,271 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-11 02:31:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:31:07,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-11 02:31:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-11 02:31:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-11 02:31:07,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-11 02:31:07,333 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-11 02:31:07,336 INFO L225 Difference]: With dead ends: 49 [2020-07-11 02:31:07,336 INFO L226 Difference]: Without dead ends: 47 [2020-07-11 02:31:07,337 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-11 02:31:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-11 02:31:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-07-11 02:31:07,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:07,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2020-07-11 02:31:07,394 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2020-07-11 02:31:07,395 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2020-07-11 02:31:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,400 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-11 02:31:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-11 02:31:07,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:07,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:07,401 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2020-07-11 02:31:07,401 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2020-07-11 02:31:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,406 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-11 02:31:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-11 02:31:07,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:07,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:07,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:07,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-11 02:31:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-11 02:31:07,411 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 24 [2020-07-11 02:31:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:07,412 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-11 02:31:07,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:31:07,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2020-07-11 02:31:07,471 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-11 02:31:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-11 02:31:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-11 02:31:07,473 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:07,473 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-11 02:31:07,473 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:31:07,473 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:07,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1589830701, now seen corresponding path program 1 times [2020-07-11 02:31:07,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:07,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [989993543] [2020-07-11 02:31:07,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-11 02:31:07,511 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {597#true} {597#true} #67#return; {597#true} is VALID [2020-07-11 02:31:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {597#true} ~cond := #in~cond; {597#true} is VALID [2020-07-11 02:31:07,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {597#true} assume !(0 == ~cond); {597#true} is VALID [2020-07-11 02:31:07,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-11 02:31:07,518 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {597#true} {598#false} #71#return; {598#false} is VALID [2020-07-11 02:31:07,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2020-07-11 02:31:07,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-11 02:31:07,519 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} #67#return; {597#true} is VALID [2020-07-11 02:31:07,520 INFO L263 TraceCheckUtils]: 3: Hoare triple {597#true} call #t~ret3 := main(); {597#true} is VALID [2020-07-11 02:31:07,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {597#true} havoc ~offset~0; {597#true} is VALID [2020-07-11 02:31:07,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {597#true} havoc ~length~0; {597#true} is VALID [2020-07-11 02:31:07,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {597#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {597#true} is VALID [2020-07-11 02:31:07,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {597#true} ~nlen~0 := #t~nondet0; {597#true} is VALID [2020-07-11 02:31:07,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {597#true} havoc #t~nondet0; {597#true} is VALID [2020-07-11 02:31:07,521 INFO L280 TraceCheckUtils]: 9: Hoare triple {597#true} havoc ~i~0; {597#true} is VALID [2020-07-11 02:31:07,522 INFO L280 TraceCheckUtils]: 10: Hoare triple {597#true} havoc ~j~0; {597#true} is VALID [2020-07-11 02:31:07,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {597#true} ~i~0 := 0; {597#true} is VALID [2020-07-11 02:31:07,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {597#true} assume !!(~i~0 < ~nlen~0); {597#true} is VALID [2020-07-11 02:31:07,523 INFO L280 TraceCheckUtils]: 13: Hoare triple {597#true} ~j~0 := 0; {601#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:07,524 INFO L280 TraceCheckUtils]: 14: Hoare triple {601#(<= main_~j~0 0)} assume !(~j~0 < 8); {598#false} is VALID [2020-07-11 02:31:07,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {598#false} #t~post1 := ~i~0; {598#false} is VALID [2020-07-11 02:31:07,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {598#false} ~i~0 := 1 + #t~post1; {598#false} is VALID [2020-07-11 02:31:07,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {598#false} havoc #t~post1; {598#false} is VALID [2020-07-11 02:31:07,525 INFO L280 TraceCheckUtils]: 18: Hoare triple {598#false} assume !!(~i~0 < ~nlen~0); {598#false} is VALID [2020-07-11 02:31:07,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {598#false} ~j~0 := 0; {598#false} is VALID [2020-07-11 02:31:07,526 INFO L280 TraceCheckUtils]: 20: Hoare triple {598#false} assume !!(~j~0 < 8); {598#false} is VALID [2020-07-11 02:31:07,526 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-11 02:31:07,527 INFO L280 TraceCheckUtils]: 22: Hoare triple {597#true} ~cond := #in~cond; {597#true} is VALID [2020-07-11 02:31:07,527 INFO L280 TraceCheckUtils]: 23: Hoare triple {597#true} assume !(0 == ~cond); {597#true} is VALID [2020-07-11 02:31:07,527 INFO L280 TraceCheckUtils]: 24: Hoare triple {597#true} assume true; {597#true} is VALID [2020-07-11 02:31:07,528 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {597#true} {598#false} #71#return; {598#false} is VALID [2020-07-11 02:31:07,528 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-11 02:31:07,528 INFO L280 TraceCheckUtils]: 27: Hoare triple {598#false} ~cond := #in~cond; {598#false} is VALID [2020-07-11 02:31:07,529 INFO L280 TraceCheckUtils]: 28: Hoare triple {598#false} assume 0 == ~cond; {598#false} is VALID [2020-07-11 02:31:07,529 INFO L280 TraceCheckUtils]: 29: Hoare triple {598#false} assume !false; {598#false} is VALID [2020-07-11 02:31:07,532 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-11 02:31:07,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [989993543] [2020-07-11 02:31:07,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:07,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:31:07,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330424845] [2020-07-11 02:31:07,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-11 02:31:07,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:07,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:31:07,569 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-11 02:31:07,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:31:07,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:07,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:31:07,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:31:07,570 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2020-07-11 02:31:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,715 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-11 02:31:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:31:07,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-11 02:31:07,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:31:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-11 02:31:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:31:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-11 02:31:07,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-11 02:31:07,782 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-11 02:31:07,784 INFO L225 Difference]: With dead ends: 76 [2020-07-11 02:31:07,785 INFO L226 Difference]: Without dead ends: 55 [2020-07-11 02:31:07,785 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-11 02:31:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-11 02:31:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2020-07-11 02:31:07,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:07,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 47 states. [2020-07-11 02:31:07,839 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 47 states. [2020-07-11 02:31:07,839 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 47 states. [2020-07-11 02:31:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,843 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-11 02:31:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-11 02:31:07,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:07,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:07,845 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 55 states. [2020-07-11 02:31:07,845 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 55 states. [2020-07-11 02:31:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,849 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-11 02:31:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-11 02:31:07,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:07,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:07,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:07,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 02:31:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-11 02:31:07,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-11 02:31:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:07,854 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-11 02:31:07,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:31:07,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-11 02:31:07,913 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-11 02:31:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-11 02:31:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-11 02:31:07,914 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:07,915 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-11 02:31:07,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:31:07,915 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 156681780, now seen corresponding path program 1 times [2020-07-11 02:31:07,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:07,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840244572] [2020-07-11 02:31:07,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:07,993 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {964#true} {964#true} #67#return; {964#true} is VALID [2020-07-11 02:31:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-11 02:31:08,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-11 02:31:08,003 INFO L280 TraceCheckUtils]: 2: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:08,004 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #71#return; {968#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-11 02:31:08,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-11 02:31:08,016 INFO L280 TraceCheckUtils]: 2: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:08,019 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #73#return; {968#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-11 02:31:08,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-11 02:31:08,027 INFO L280 TraceCheckUtils]: 2: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:08,027 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {964#true} {965#false} #71#return; {965#false} is VALID [2020-07-11 02:31:08,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {964#true} call ULTIMATE.init(); {964#true} is VALID [2020-07-11 02:31:08,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:08,028 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {964#true} {964#true} #67#return; {964#true} is VALID [2020-07-11 02:31:08,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {964#true} call #t~ret3 := main(); {964#true} is VALID [2020-07-11 02:31:08,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {964#true} havoc ~offset~0; {964#true} is VALID [2020-07-11 02:31:08,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {964#true} havoc ~length~0; {964#true} is VALID [2020-07-11 02:31:08,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {964#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {964#true} is VALID [2020-07-11 02:31:08,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {964#true} ~nlen~0 := #t~nondet0; {964#true} is VALID [2020-07-11 02:31:08,030 INFO L280 TraceCheckUtils]: 8: Hoare triple {964#true} havoc #t~nondet0; {964#true} is VALID [2020-07-11 02:31:08,031 INFO L280 TraceCheckUtils]: 9: Hoare triple {964#true} havoc ~i~0; {964#true} is VALID [2020-07-11 02:31:08,031 INFO L280 TraceCheckUtils]: 10: Hoare triple {964#true} havoc ~j~0; {964#true} is VALID [2020-07-11 02:31:08,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {964#true} ~i~0 := 0; {964#true} is VALID [2020-07-11 02:31:08,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {964#true} assume !!(~i~0 < ~nlen~0); {964#true} is VALID [2020-07-11 02:31:08,033 INFO L280 TraceCheckUtils]: 13: Hoare triple {964#true} ~j~0 := 0; {968#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {968#(<= main_~j~0 0)} assume !!(~j~0 < 8); {968#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,034 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-11 02:31:08,034 INFO L280 TraceCheckUtils]: 16: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-11 02:31:08,034 INFO L280 TraceCheckUtils]: 17: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-11 02:31:08,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:08,036 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #71#return; {968#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,036 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-11 02:31:08,036 INFO L280 TraceCheckUtils]: 21: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-11 02:31:08,036 INFO L280 TraceCheckUtils]: 22: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-11 02:31:08,037 INFO L280 TraceCheckUtils]: 23: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:08,048 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {964#true} {968#(<= main_~j~0 0)} #73#return; {968#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,049 INFO L280 TraceCheckUtils]: 25: Hoare triple {968#(<= main_~j~0 0)} #t~post2 := ~j~0; {977#(<= |main_#t~post2| 0)} is VALID [2020-07-11 02:31:08,050 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-11 02:31:08,056 INFO L280 TraceCheckUtils]: 27: Hoare triple {978#(<= main_~j~0 1)} havoc #t~post2; {978#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:08,057 INFO L280 TraceCheckUtils]: 28: Hoare triple {978#(<= main_~j~0 1)} assume !(~j~0 < 8); {965#false} is VALID [2020-07-11 02:31:08,057 INFO L280 TraceCheckUtils]: 29: Hoare triple {965#false} #t~post1 := ~i~0; {965#false} is VALID [2020-07-11 02:31:08,057 INFO L280 TraceCheckUtils]: 30: Hoare triple {965#false} ~i~0 := 1 + #t~post1; {965#false} is VALID [2020-07-11 02:31:08,057 INFO L280 TraceCheckUtils]: 31: Hoare triple {965#false} havoc #t~post1; {965#false} is VALID [2020-07-11 02:31:08,058 INFO L280 TraceCheckUtils]: 32: Hoare triple {965#false} assume !!(~i~0 < ~nlen~0); {965#false} is VALID [2020-07-11 02:31:08,058 INFO L280 TraceCheckUtils]: 33: Hoare triple {965#false} ~j~0 := 0; {965#false} is VALID [2020-07-11 02:31:08,058 INFO L280 TraceCheckUtils]: 34: Hoare triple {965#false} assume !!(~j~0 < 8); {965#false} is VALID [2020-07-11 02:31:08,058 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-11 02:31:08,059 INFO L280 TraceCheckUtils]: 36: Hoare triple {964#true} ~cond := #in~cond; {964#true} is VALID [2020-07-11 02:31:08,059 INFO L280 TraceCheckUtils]: 37: Hoare triple {964#true} assume !(0 == ~cond); {964#true} is VALID [2020-07-11 02:31:08,059 INFO L280 TraceCheckUtils]: 38: Hoare triple {964#true} assume true; {964#true} is VALID [2020-07-11 02:31:08,059 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {964#true} {965#false} #71#return; {965#false} is VALID [2020-07-11 02:31:08,060 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-11 02:31:08,060 INFO L280 TraceCheckUtils]: 41: Hoare triple {965#false} ~cond := #in~cond; {965#false} is VALID [2020-07-11 02:31:08,065 INFO L280 TraceCheckUtils]: 42: Hoare triple {965#false} assume 0 == ~cond; {965#false} is VALID [2020-07-11 02:31:08,066 INFO L280 TraceCheckUtils]: 43: Hoare triple {965#false} assume !false; {965#false} is VALID [2020-07-11 02:31:08,072 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-11 02:31:08,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840244572] [2020-07-11 02:31:08,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:08,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 02:31:08,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807919534] [2020-07-11 02:31:08,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-11 02:31:08,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:08,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:31:08,123 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-11 02:31:08,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:31:08,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:08,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:31:08,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:31:08,124 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-11 02:31:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:08,359 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2020-07-11 02:31:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:31:08,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-11 02:31:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-07-11 02:31:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-07-11 02:31:08,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2020-07-11 02:31:08,438 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-11 02:31:08,442 INFO L225 Difference]: With dead ends: 89 [2020-07-11 02:31:08,442 INFO L226 Difference]: Without dead ends: 67 [2020-07-11 02:31:08,443 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-11 02:31:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-11 02:31:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2020-07-11 02:31:08,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:08,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 59 states. [2020-07-11 02:31:08,526 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 59 states. [2020-07-11 02:31:08,526 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 59 states. [2020-07-11 02:31:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:08,530 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-11 02:31:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-07-11 02:31:08,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:08,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:08,532 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 67 states. [2020-07-11 02:31:08,532 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 67 states. [2020-07-11 02:31:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:08,536 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-11 02:31:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-07-11 02:31:08,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:08,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:08,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:08,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-11 02:31:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-11 02:31:08,541 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 44 [2020-07-11 02:31:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:08,542 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-11 02:31:08,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:31:08,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2020-07-11 02:31:08,631 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-11 02:31:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-11 02:31:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-11 02:31:08,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:08,635 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-11 02:31:08,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:31:08,635 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:08,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1839058219, now seen corresponding path program 2 times [2020-07-11 02:31:08,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:08,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224822421] [2020-07-11 02:31:08,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,754 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1419#true} {1419#true} #67#return; {1419#true} is VALID [2020-07-11 02:31:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,766 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #71#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,780 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #73#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,797 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #71#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,805 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #73#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,810 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1419#true} {1420#false} #71#return; {1420#false} is VALID [2020-07-11 02:31:08,810 INFO L263 TraceCheckUtils]: 0: Hoare triple {1419#true} call ULTIMATE.init(); {1419#true} is VALID [2020-07-11 02:31:08,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,810 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1419#true} {1419#true} #67#return; {1419#true} is VALID [2020-07-11 02:31:08,811 INFO L263 TraceCheckUtils]: 3: Hoare triple {1419#true} call #t~ret3 := main(); {1419#true} is VALID [2020-07-11 02:31:08,811 INFO L280 TraceCheckUtils]: 4: Hoare triple {1419#true} havoc ~offset~0; {1419#true} is VALID [2020-07-11 02:31:08,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {1419#true} havoc ~length~0; {1419#true} is VALID [2020-07-11 02:31:08,811 INFO L280 TraceCheckUtils]: 6: Hoare triple {1419#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1419#true} is VALID [2020-07-11 02:31:08,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {1419#true} ~nlen~0 := #t~nondet0; {1419#true} is VALID [2020-07-11 02:31:08,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {1419#true} havoc #t~nondet0; {1419#true} is VALID [2020-07-11 02:31:08,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {1419#true} havoc ~i~0; {1419#true} is VALID [2020-07-11 02:31:08,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {1419#true} havoc ~j~0; {1419#true} is VALID [2020-07-11 02:31:08,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {1419#true} ~i~0 := 0; {1419#true} is VALID [2020-07-11 02:31:08,813 INFO L280 TraceCheckUtils]: 12: Hoare triple {1419#true} assume !!(~i~0 < ~nlen~0); {1419#true} is VALID [2020-07-11 02:31:08,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {1419#true} ~j~0 := 0; {1423#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {1423#(<= main_~j~0 0)} assume !!(~j~0 < 8); {1423#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,814 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-11 02:31:08,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,815 INFO L280 TraceCheckUtils]: 17: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,815 INFO L280 TraceCheckUtils]: 18: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,816 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #71#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,816 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-11 02:31:08,817 INFO L280 TraceCheckUtils]: 21: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,817 INFO L280 TraceCheckUtils]: 22: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,817 INFO L280 TraceCheckUtils]: 23: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,818 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1419#true} {1423#(<= main_~j~0 0)} #73#return; {1423#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:08,819 INFO L280 TraceCheckUtils]: 25: Hoare triple {1423#(<= main_~j~0 0)} #t~post2 := ~j~0; {1432#(<= |main_#t~post2| 0)} is VALID [2020-07-11 02:31:08,820 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-11 02:31:08,821 INFO L280 TraceCheckUtils]: 27: Hoare triple {1433#(<= main_~j~0 1)} havoc #t~post2; {1433#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:08,822 INFO L280 TraceCheckUtils]: 28: Hoare triple {1433#(<= main_~j~0 1)} assume !!(~j~0 < 8); {1433#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:08,822 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-11 02:31:08,822 INFO L280 TraceCheckUtils]: 30: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,823 INFO L280 TraceCheckUtils]: 31: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,823 INFO L280 TraceCheckUtils]: 32: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,824 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #71#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:08,824 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-11 02:31:08,824 INFO L280 TraceCheckUtils]: 35: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,825 INFO L280 TraceCheckUtils]: 36: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,825 INFO L280 TraceCheckUtils]: 37: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,826 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1419#true} {1433#(<= main_~j~0 1)} #73#return; {1433#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:08,827 INFO L280 TraceCheckUtils]: 39: Hoare triple {1433#(<= main_~j~0 1)} #t~post2 := ~j~0; {1442#(<= |main_#t~post2| 1)} is VALID [2020-07-11 02:31:08,828 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-11 02:31:08,830 INFO L280 TraceCheckUtils]: 41: Hoare triple {1443#(<= main_~j~0 2)} havoc #t~post2; {1443#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:08,832 INFO L280 TraceCheckUtils]: 42: Hoare triple {1443#(<= main_~j~0 2)} assume !(~j~0 < 8); {1420#false} is VALID [2020-07-11 02:31:08,833 INFO L280 TraceCheckUtils]: 43: Hoare triple {1420#false} #t~post1 := ~i~0; {1420#false} is VALID [2020-07-11 02:31:08,833 INFO L280 TraceCheckUtils]: 44: Hoare triple {1420#false} ~i~0 := 1 + #t~post1; {1420#false} is VALID [2020-07-11 02:31:08,833 INFO L280 TraceCheckUtils]: 45: Hoare triple {1420#false} havoc #t~post1; {1420#false} is VALID [2020-07-11 02:31:08,833 INFO L280 TraceCheckUtils]: 46: Hoare triple {1420#false} assume !!(~i~0 < ~nlen~0); {1420#false} is VALID [2020-07-11 02:31:08,834 INFO L280 TraceCheckUtils]: 47: Hoare triple {1420#false} ~j~0 := 0; {1420#false} is VALID [2020-07-11 02:31:08,834 INFO L280 TraceCheckUtils]: 48: Hoare triple {1420#false} assume !!(~j~0 < 8); {1420#false} is VALID [2020-07-11 02:31:08,834 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-11 02:31:08,834 INFO L280 TraceCheckUtils]: 50: Hoare triple {1419#true} ~cond := #in~cond; {1419#true} is VALID [2020-07-11 02:31:08,834 INFO L280 TraceCheckUtils]: 51: Hoare triple {1419#true} assume !(0 == ~cond); {1419#true} is VALID [2020-07-11 02:31:08,835 INFO L280 TraceCheckUtils]: 52: Hoare triple {1419#true} assume true; {1419#true} is VALID [2020-07-11 02:31:08,835 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {1419#true} {1420#false} #71#return; {1420#false} is VALID [2020-07-11 02:31:08,835 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-11 02:31:08,835 INFO L280 TraceCheckUtils]: 55: Hoare triple {1420#false} ~cond := #in~cond; {1420#false} is VALID [2020-07-11 02:31:08,836 INFO L280 TraceCheckUtils]: 56: Hoare triple {1420#false} assume 0 == ~cond; {1420#false} is VALID [2020-07-11 02:31:08,836 INFO L280 TraceCheckUtils]: 57: Hoare triple {1420#false} assume !false; {1420#false} is VALID [2020-07-11 02:31:08,839 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-11 02:31:08,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224822421] [2020-07-11 02:31:08,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:08,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:31:08,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437250909] [2020-07-11 02:31:08,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2020-07-11 02:31:08,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:08,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:31:08,885 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-11 02:31:08,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:31:08,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:31:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:31:08,886 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 7 states. [2020-07-11 02:31:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:09,201 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2020-07-11 02:31:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:31:09,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2020-07-11 02:31:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2020-07-11 02:31:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2020-07-11 02:31:09,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 74 transitions. [2020-07-11 02:31:09,282 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-11 02:31:09,285 INFO L225 Difference]: With dead ends: 107 [2020-07-11 02:31:09,285 INFO L226 Difference]: Without dead ends: 79 [2020-07-11 02:31:09,286 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-11 02:31:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-11 02:31:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2020-07-11 02:31:09,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:09,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 71 states. [2020-07-11 02:31:09,386 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 71 states. [2020-07-11 02:31:09,386 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 71 states. [2020-07-11 02:31:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:09,392 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2020-07-11 02:31:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-07-11 02:31:09,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:09,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:09,393 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 79 states. [2020-07-11 02:31:09,393 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 79 states. [2020-07-11 02:31:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:09,398 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2020-07-11 02:31:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-07-11 02:31:09,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:09,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:09,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:09,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-11 02:31:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2020-07-11 02:31:09,404 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 58 [2020-07-11 02:31:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:09,404 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2020-07-11 02:31:09,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:31:09,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 82 transitions. [2020-07-11 02:31:09,501 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-11 02:31:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-11 02:31:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-11 02:31:09,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:09,503 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-11 02:31:09,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:31:09,503 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:09,503 INFO L82 PathProgramCache]: Analyzing trace with hash -101962, now seen corresponding path program 3 times [2020-07-11 02:31:09,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:09,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004457162] [2020-07-11 02:31:09,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,609 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1972#true} {1972#true} #67#return; {1972#true} is VALID [2020-07-11 02:31:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,618 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #71#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,635 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #73#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,652 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #71#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,668 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,668 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #73#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #71#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,696 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #73#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:09,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,707 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1972#true} {1973#false} #71#return; {1973#false} is VALID [2020-07-11 02:31:09,708 INFO L263 TraceCheckUtils]: 0: Hoare triple {1972#true} call ULTIMATE.init(); {1972#true} is VALID [2020-07-11 02:31:09,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,708 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1972#true} {1972#true} #67#return; {1972#true} is VALID [2020-07-11 02:31:09,708 INFO L263 TraceCheckUtils]: 3: Hoare triple {1972#true} call #t~ret3 := main(); {1972#true} is VALID [2020-07-11 02:31:09,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {1972#true} havoc ~offset~0; {1972#true} is VALID [2020-07-11 02:31:09,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {1972#true} havoc ~length~0; {1972#true} is VALID [2020-07-11 02:31:09,709 INFO L280 TraceCheckUtils]: 6: Hoare triple {1972#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1972#true} is VALID [2020-07-11 02:31:09,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {1972#true} ~nlen~0 := #t~nondet0; {1972#true} is VALID [2020-07-11 02:31:09,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {1972#true} havoc #t~nondet0; {1972#true} is VALID [2020-07-11 02:31:09,713 INFO L280 TraceCheckUtils]: 9: Hoare triple {1972#true} havoc ~i~0; {1972#true} is VALID [2020-07-11 02:31:09,713 INFO L280 TraceCheckUtils]: 10: Hoare triple {1972#true} havoc ~j~0; {1972#true} is VALID [2020-07-11 02:31:09,713 INFO L280 TraceCheckUtils]: 11: Hoare triple {1972#true} ~i~0 := 0; {1972#true} is VALID [2020-07-11 02:31:09,714 INFO L280 TraceCheckUtils]: 12: Hoare triple {1972#true} assume !!(~i~0 < ~nlen~0); {1972#true} is VALID [2020-07-11 02:31:09,718 INFO L280 TraceCheckUtils]: 13: Hoare triple {1972#true} ~j~0 := 0; {1976#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:09,719 INFO L280 TraceCheckUtils]: 14: Hoare triple {1976#(<= main_~j~0 0)} assume !!(~j~0 < 8); {1976#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:09,719 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-11 02:31:09,720 INFO L280 TraceCheckUtils]: 16: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,720 INFO L280 TraceCheckUtils]: 17: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,721 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #71#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:09,721 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-11 02:31:09,721 INFO L280 TraceCheckUtils]: 21: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,721 INFO L280 TraceCheckUtils]: 22: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,722 INFO L280 TraceCheckUtils]: 23: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,722 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1972#true} {1976#(<= main_~j~0 0)} #73#return; {1976#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:09,723 INFO L280 TraceCheckUtils]: 25: Hoare triple {1976#(<= main_~j~0 0)} #t~post2 := ~j~0; {1985#(<= |main_#t~post2| 0)} is VALID [2020-07-11 02:31:09,724 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-11 02:31:09,724 INFO L280 TraceCheckUtils]: 27: Hoare triple {1986#(<= main_~j~0 1)} havoc #t~post2; {1986#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:09,725 INFO L280 TraceCheckUtils]: 28: Hoare triple {1986#(<= main_~j~0 1)} assume !!(~j~0 < 8); {1986#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:09,725 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-11 02:31:09,725 INFO L280 TraceCheckUtils]: 30: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,725 INFO L280 TraceCheckUtils]: 31: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,725 INFO L280 TraceCheckUtils]: 32: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,727 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #71#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:09,727 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-11 02:31:09,727 INFO L280 TraceCheckUtils]: 35: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,727 INFO L280 TraceCheckUtils]: 36: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,728 INFO L280 TraceCheckUtils]: 37: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,729 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1972#true} {1986#(<= main_~j~0 1)} #73#return; {1986#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:09,730 INFO L280 TraceCheckUtils]: 39: Hoare triple {1986#(<= main_~j~0 1)} #t~post2 := ~j~0; {1995#(<= |main_#t~post2| 1)} is VALID [2020-07-11 02:31:09,731 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-11 02:31:09,731 INFO L280 TraceCheckUtils]: 41: Hoare triple {1996#(<= main_~j~0 2)} havoc #t~post2; {1996#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:09,732 INFO L280 TraceCheckUtils]: 42: Hoare triple {1996#(<= main_~j~0 2)} assume !!(~j~0 < 8); {1996#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:09,732 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-11 02:31:09,732 INFO L280 TraceCheckUtils]: 44: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,733 INFO L280 TraceCheckUtils]: 45: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,733 INFO L280 TraceCheckUtils]: 46: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,734 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #71#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:09,734 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-11 02:31:09,734 INFO L280 TraceCheckUtils]: 49: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,734 INFO L280 TraceCheckUtils]: 50: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,735 INFO L280 TraceCheckUtils]: 51: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,735 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1972#true} {1996#(<= main_~j~0 2)} #73#return; {1996#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:09,736 INFO L280 TraceCheckUtils]: 53: Hoare triple {1996#(<= main_~j~0 2)} #t~post2 := ~j~0; {2005#(<= |main_#t~post2| 2)} is VALID [2020-07-11 02:31:09,737 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-11 02:31:09,737 INFO L280 TraceCheckUtils]: 55: Hoare triple {2006#(<= main_~j~0 3)} havoc #t~post2; {2006#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:09,738 INFO L280 TraceCheckUtils]: 56: Hoare triple {2006#(<= main_~j~0 3)} assume !(~j~0 < 8); {1973#false} is VALID [2020-07-11 02:31:09,738 INFO L280 TraceCheckUtils]: 57: Hoare triple {1973#false} #t~post1 := ~i~0; {1973#false} is VALID [2020-07-11 02:31:09,739 INFO L280 TraceCheckUtils]: 58: Hoare triple {1973#false} ~i~0 := 1 + #t~post1; {1973#false} is VALID [2020-07-11 02:31:09,739 INFO L280 TraceCheckUtils]: 59: Hoare triple {1973#false} havoc #t~post1; {1973#false} is VALID [2020-07-11 02:31:09,739 INFO L280 TraceCheckUtils]: 60: Hoare triple {1973#false} assume !!(~i~0 < ~nlen~0); {1973#false} is VALID [2020-07-11 02:31:09,739 INFO L280 TraceCheckUtils]: 61: Hoare triple {1973#false} ~j~0 := 0; {1973#false} is VALID [2020-07-11 02:31:09,739 INFO L280 TraceCheckUtils]: 62: Hoare triple {1973#false} assume !!(~j~0 < 8); {1973#false} is VALID [2020-07-11 02:31:09,740 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-11 02:31:09,740 INFO L280 TraceCheckUtils]: 64: Hoare triple {1972#true} ~cond := #in~cond; {1972#true} is VALID [2020-07-11 02:31:09,740 INFO L280 TraceCheckUtils]: 65: Hoare triple {1972#true} assume !(0 == ~cond); {1972#true} is VALID [2020-07-11 02:31:09,740 INFO L280 TraceCheckUtils]: 66: Hoare triple {1972#true} assume true; {1972#true} is VALID [2020-07-11 02:31:09,741 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {1972#true} {1973#false} #71#return; {1973#false} is VALID [2020-07-11 02:31:09,741 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-11 02:31:09,741 INFO L280 TraceCheckUtils]: 69: Hoare triple {1973#false} ~cond := #in~cond; {1973#false} is VALID [2020-07-11 02:31:09,741 INFO L280 TraceCheckUtils]: 70: Hoare triple {1973#false} assume 0 == ~cond; {1973#false} is VALID [2020-07-11 02:31:09,742 INFO L280 TraceCheckUtils]: 71: Hoare triple {1973#false} assume !false; {1973#false} is VALID [2020-07-11 02:31:09,747 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-11 02:31:09,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004457162] [2020-07-11 02:31:09,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:09,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 02:31:09,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607316805] [2020-07-11 02:31:09,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-07-11 02:31:09,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:09,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:31:09,808 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-11 02:31:09,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:31:09,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:31:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:31:09,809 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 9 states. [2020-07-11 02:31:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:10,261 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2020-07-11 02:31:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:31:10,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-07-11 02:31:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-11 02:31:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-11 02:31:10,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2020-07-11 02:31:10,372 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-11 02:31:10,375 INFO L225 Difference]: With dead ends: 125 [2020-07-11 02:31:10,376 INFO L226 Difference]: Without dead ends: 91 [2020-07-11 02:31:10,377 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-11 02:31:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-11 02:31:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2020-07-11 02:31:10,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:10,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 83 states. [2020-07-11 02:31:10,544 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 83 states. [2020-07-11 02:31:10,544 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 83 states. [2020-07-11 02:31:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:10,548 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-07-11 02:31:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-07-11 02:31:10,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:10,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:10,549 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 91 states. [2020-07-11 02:31:10,550 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 91 states. [2020-07-11 02:31:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:10,554 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-07-11 02:31:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-07-11 02:31:10,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:10,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:10,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:10,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-11 02:31:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2020-07-11 02:31:10,559 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 72 [2020-07-11 02:31:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:10,559 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2020-07-11 02:31:10,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:31:10,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 98 transitions. [2020-07-11 02:31:10,695 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-11 02:31:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2020-07-11 02:31:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-11 02:31:10,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:10,697 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-11 02:31:10,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:31:10,699 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1976659241, now seen corresponding path program 4 times [2020-07-11 02:31:10,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:10,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1963432536] [2020-07-11 02:31:10,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,854 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2623#true} {2623#true} #67#return; {2623#true} is VALID [2020-07-11 02:31:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #71#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,872 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,873 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #73#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,888 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #71#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,902 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #73#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #71#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,912 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #73#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,928 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #71#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,939 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #73#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:10,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,951 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2623#true} {2624#false} #71#return; {2624#false} is VALID [2020-07-11 02:31:10,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {2623#true} call ULTIMATE.init(); {2623#true} is VALID [2020-07-11 02:31:10,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,952 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2623#true} {2623#true} #67#return; {2623#true} is VALID [2020-07-11 02:31:10,952 INFO L263 TraceCheckUtils]: 3: Hoare triple {2623#true} call #t~ret3 := main(); {2623#true} is VALID [2020-07-11 02:31:10,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {2623#true} havoc ~offset~0; {2623#true} is VALID [2020-07-11 02:31:10,952 INFO L280 TraceCheckUtils]: 5: Hoare triple {2623#true} havoc ~length~0; {2623#true} is VALID [2020-07-11 02:31:10,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {2623#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2623#true} is VALID [2020-07-11 02:31:10,953 INFO L280 TraceCheckUtils]: 7: Hoare triple {2623#true} ~nlen~0 := #t~nondet0; {2623#true} is VALID [2020-07-11 02:31:10,953 INFO L280 TraceCheckUtils]: 8: Hoare triple {2623#true} havoc #t~nondet0; {2623#true} is VALID [2020-07-11 02:31:10,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {2623#true} havoc ~i~0; {2623#true} is VALID [2020-07-11 02:31:10,954 INFO L280 TraceCheckUtils]: 10: Hoare triple {2623#true} havoc ~j~0; {2623#true} is VALID [2020-07-11 02:31:10,954 INFO L280 TraceCheckUtils]: 11: Hoare triple {2623#true} ~i~0 := 0; {2623#true} is VALID [2020-07-11 02:31:10,954 INFO L280 TraceCheckUtils]: 12: Hoare triple {2623#true} assume !!(~i~0 < ~nlen~0); {2623#true} is VALID [2020-07-11 02:31:10,955 INFO L280 TraceCheckUtils]: 13: Hoare triple {2623#true} ~j~0 := 0; {2627#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:10,955 INFO L280 TraceCheckUtils]: 14: Hoare triple {2627#(<= main_~j~0 0)} assume !!(~j~0 < 8); {2627#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:10,956 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-11 02:31:10,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,956 INFO L280 TraceCheckUtils]: 18: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,960 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #71#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:10,960 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-11 02:31:10,960 INFO L280 TraceCheckUtils]: 21: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,960 INFO L280 TraceCheckUtils]: 22: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,960 INFO L280 TraceCheckUtils]: 23: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,961 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2623#true} {2627#(<= main_~j~0 0)} #73#return; {2627#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:10,962 INFO L280 TraceCheckUtils]: 25: Hoare triple {2627#(<= main_~j~0 0)} #t~post2 := ~j~0; {2636#(<= |main_#t~post2| 0)} is VALID [2020-07-11 02:31:10,963 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-11 02:31:10,963 INFO L280 TraceCheckUtils]: 27: Hoare triple {2637#(<= main_~j~0 1)} havoc #t~post2; {2637#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:10,964 INFO L280 TraceCheckUtils]: 28: Hoare triple {2637#(<= main_~j~0 1)} assume !!(~j~0 < 8); {2637#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:10,964 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-11 02:31:10,964 INFO L280 TraceCheckUtils]: 30: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,964 INFO L280 TraceCheckUtils]: 31: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,965 INFO L280 TraceCheckUtils]: 32: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,965 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #71#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:10,966 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-11 02:31:10,966 INFO L280 TraceCheckUtils]: 35: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,966 INFO L280 TraceCheckUtils]: 36: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,967 INFO L280 TraceCheckUtils]: 37: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,968 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2623#true} {2637#(<= main_~j~0 1)} #73#return; {2637#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:10,968 INFO L280 TraceCheckUtils]: 39: Hoare triple {2637#(<= main_~j~0 1)} #t~post2 := ~j~0; {2646#(<= |main_#t~post2| 1)} is VALID [2020-07-11 02:31:10,969 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-11 02:31:10,970 INFO L280 TraceCheckUtils]: 41: Hoare triple {2647#(<= main_~j~0 2)} havoc #t~post2; {2647#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:10,974 INFO L280 TraceCheckUtils]: 42: Hoare triple {2647#(<= main_~j~0 2)} assume !!(~j~0 < 8); {2647#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:10,974 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-11 02:31:10,974 INFO L280 TraceCheckUtils]: 44: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,975 INFO L280 TraceCheckUtils]: 45: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,975 INFO L280 TraceCheckUtils]: 46: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,976 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #71#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:10,976 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-11 02:31:10,976 INFO L280 TraceCheckUtils]: 49: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,976 INFO L280 TraceCheckUtils]: 50: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,976 INFO L280 TraceCheckUtils]: 51: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,977 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2623#true} {2647#(<= main_~j~0 2)} #73#return; {2647#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:10,978 INFO L280 TraceCheckUtils]: 53: Hoare triple {2647#(<= main_~j~0 2)} #t~post2 := ~j~0; {2656#(<= |main_#t~post2| 2)} is VALID [2020-07-11 02:31:10,978 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-11 02:31:10,979 INFO L280 TraceCheckUtils]: 55: Hoare triple {2657#(<= main_~j~0 3)} havoc #t~post2; {2657#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:10,980 INFO L280 TraceCheckUtils]: 56: Hoare triple {2657#(<= main_~j~0 3)} assume !!(~j~0 < 8); {2657#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:10,980 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-11 02:31:10,980 INFO L280 TraceCheckUtils]: 58: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,980 INFO L280 TraceCheckUtils]: 59: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,980 INFO L280 TraceCheckUtils]: 60: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,981 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #71#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:10,981 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-11 02:31:10,981 INFO L280 TraceCheckUtils]: 63: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,982 INFO L280 TraceCheckUtils]: 64: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,982 INFO L280 TraceCheckUtils]: 65: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,983 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {2623#true} {2657#(<= main_~j~0 3)} #73#return; {2657#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:10,984 INFO L280 TraceCheckUtils]: 67: Hoare triple {2657#(<= main_~j~0 3)} #t~post2 := ~j~0; {2666#(<= |main_#t~post2| 3)} is VALID [2020-07-11 02:31:10,985 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-11 02:31:10,985 INFO L280 TraceCheckUtils]: 69: Hoare triple {2667#(<= main_~j~0 4)} havoc #t~post2; {2667#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:10,986 INFO L280 TraceCheckUtils]: 70: Hoare triple {2667#(<= main_~j~0 4)} assume !(~j~0 < 8); {2624#false} is VALID [2020-07-11 02:31:10,986 INFO L280 TraceCheckUtils]: 71: Hoare triple {2624#false} #t~post1 := ~i~0; {2624#false} is VALID [2020-07-11 02:31:10,986 INFO L280 TraceCheckUtils]: 72: Hoare triple {2624#false} ~i~0 := 1 + #t~post1; {2624#false} is VALID [2020-07-11 02:31:10,987 INFO L280 TraceCheckUtils]: 73: Hoare triple {2624#false} havoc #t~post1; {2624#false} is VALID [2020-07-11 02:31:10,987 INFO L280 TraceCheckUtils]: 74: Hoare triple {2624#false} assume !!(~i~0 < ~nlen~0); {2624#false} is VALID [2020-07-11 02:31:10,987 INFO L280 TraceCheckUtils]: 75: Hoare triple {2624#false} ~j~0 := 0; {2624#false} is VALID [2020-07-11 02:31:10,987 INFO L280 TraceCheckUtils]: 76: Hoare triple {2624#false} assume !!(~j~0 < 8); {2624#false} is VALID [2020-07-11 02:31:10,987 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-11 02:31:10,988 INFO L280 TraceCheckUtils]: 78: Hoare triple {2623#true} ~cond := #in~cond; {2623#true} is VALID [2020-07-11 02:31:10,988 INFO L280 TraceCheckUtils]: 79: Hoare triple {2623#true} assume !(0 == ~cond); {2623#true} is VALID [2020-07-11 02:31:10,988 INFO L280 TraceCheckUtils]: 80: Hoare triple {2623#true} assume true; {2623#true} is VALID [2020-07-11 02:31:10,988 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {2623#true} {2624#false} #71#return; {2624#false} is VALID [2020-07-11 02:31:10,988 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-11 02:31:10,989 INFO L280 TraceCheckUtils]: 83: Hoare triple {2624#false} ~cond := #in~cond; {2624#false} is VALID [2020-07-11 02:31:10,989 INFO L280 TraceCheckUtils]: 84: Hoare triple {2624#false} assume 0 == ~cond; {2624#false} is VALID [2020-07-11 02:31:10,989 INFO L280 TraceCheckUtils]: 85: Hoare triple {2624#false} assume !false; {2624#false} is VALID [2020-07-11 02:31:10,996 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-11 02:31:10,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1963432536] [2020-07-11 02:31:10,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:10,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:31:10,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036665711] [2020-07-11 02:31:10,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2020-07-11 02:31:10,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:10,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:31:11,062 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-11 02:31:11,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:31:11,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:31:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:31:11,063 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand 11 states. [2020-07-11 02:31:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:11,614 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2020-07-11 02:31:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-11 02:31:11,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2020-07-11 02:31:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:31:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2020-07-11 02:31:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:31:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2020-07-11 02:31:11,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 90 transitions. [2020-07-11 02:31:11,708 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-11 02:31:11,714 INFO L225 Difference]: With dead ends: 143 [2020-07-11 02:31:11,714 INFO L226 Difference]: Without dead ends: 103 [2020-07-11 02:31:11,715 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-11 02:31:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-11 02:31:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2020-07-11 02:31:11,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:11,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 95 states. [2020-07-11 02:31:11,878 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 95 states. [2020-07-11 02:31:11,878 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 95 states. [2020-07-11 02:31:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:11,884 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2020-07-11 02:31:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2020-07-11 02:31:11,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:11,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:11,886 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 103 states. [2020-07-11 02:31:11,886 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 103 states. [2020-07-11 02:31:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:11,891 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2020-07-11 02:31:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2020-07-11 02:31:11,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:11,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:11,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:11,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-11 02:31:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2020-07-11 02:31:11,896 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 86 [2020-07-11 02:31:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:11,897 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2020-07-11 02:31:11,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:31:11,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 114 transitions. [2020-07-11 02:31:12,036 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-11 02:31:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2020-07-11 02:31:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-07-11 02:31:12,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:12,038 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-11 02:31:12,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:31:12,038 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:12,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:12,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1582933560, now seen corresponding path program 5 times [2020-07-11 02:31:12,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:12,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [449830704] [2020-07-11 02:31:12,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,209 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3372#true} {3372#true} #67#return; {3372#true} is VALID [2020-07-11 02:31:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,222 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #71#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,232 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,233 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #73#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,239 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #71#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,248 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #73#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,260 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #71#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,272 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #73#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #71#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,288 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #73#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,305 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #71#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,316 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #73#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:12,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,322 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3372#true} {3373#false} #71#return; {3373#false} is VALID [2020-07-11 02:31:12,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {3372#true} call ULTIMATE.init(); {3372#true} is VALID [2020-07-11 02:31:12,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,323 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3372#true} {3372#true} #67#return; {3372#true} is VALID [2020-07-11 02:31:12,323 INFO L263 TraceCheckUtils]: 3: Hoare triple {3372#true} call #t~ret3 := main(); {3372#true} is VALID [2020-07-11 02:31:12,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {3372#true} havoc ~offset~0; {3372#true} is VALID [2020-07-11 02:31:12,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {3372#true} havoc ~length~0; {3372#true} is VALID [2020-07-11 02:31:12,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {3372#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3372#true} is VALID [2020-07-11 02:31:12,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {3372#true} ~nlen~0 := #t~nondet0; {3372#true} is VALID [2020-07-11 02:31:12,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {3372#true} havoc #t~nondet0; {3372#true} is VALID [2020-07-11 02:31:12,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {3372#true} havoc ~i~0; {3372#true} is VALID [2020-07-11 02:31:12,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {3372#true} havoc ~j~0; {3372#true} is VALID [2020-07-11 02:31:12,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {3372#true} ~i~0 := 0; {3372#true} is VALID [2020-07-11 02:31:12,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {3372#true} assume !!(~i~0 < ~nlen~0); {3372#true} is VALID [2020-07-11 02:31:12,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {3372#true} ~j~0 := 0; {3376#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:12,327 INFO L280 TraceCheckUtils]: 14: Hoare triple {3376#(<= main_~j~0 0)} assume !!(~j~0 < 8); {3376#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:12,327 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-11 02:31:12,327 INFO L280 TraceCheckUtils]: 16: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,328 INFO L280 TraceCheckUtils]: 17: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,328 INFO L280 TraceCheckUtils]: 18: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,329 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #71#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:12,329 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-11 02:31:12,329 INFO L280 TraceCheckUtils]: 21: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,329 INFO L280 TraceCheckUtils]: 22: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,329 INFO L280 TraceCheckUtils]: 23: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,330 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3372#true} {3376#(<= main_~j~0 0)} #73#return; {3376#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:12,331 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#(<= main_~j~0 0)} #t~post2 := ~j~0; {3385#(<= |main_#t~post2| 0)} is VALID [2020-07-11 02:31:12,332 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-11 02:31:12,332 INFO L280 TraceCheckUtils]: 27: Hoare triple {3386#(<= main_~j~0 1)} havoc #t~post2; {3386#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:12,333 INFO L280 TraceCheckUtils]: 28: Hoare triple {3386#(<= main_~j~0 1)} assume !!(~j~0 < 8); {3386#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:12,333 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-11 02:31:12,333 INFO L280 TraceCheckUtils]: 30: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,333 INFO L280 TraceCheckUtils]: 31: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,333 INFO L280 TraceCheckUtils]: 32: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,334 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #71#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:12,334 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-11 02:31:12,335 INFO L280 TraceCheckUtils]: 35: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,335 INFO L280 TraceCheckUtils]: 36: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,335 INFO L280 TraceCheckUtils]: 37: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,336 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3372#true} {3386#(<= main_~j~0 1)} #73#return; {3386#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:12,336 INFO L280 TraceCheckUtils]: 39: Hoare triple {3386#(<= main_~j~0 1)} #t~post2 := ~j~0; {3395#(<= |main_#t~post2| 1)} is VALID [2020-07-11 02:31:12,337 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-11 02:31:12,337 INFO L280 TraceCheckUtils]: 41: Hoare triple {3396#(<= main_~j~0 2)} havoc #t~post2; {3396#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:12,338 INFO L280 TraceCheckUtils]: 42: Hoare triple {3396#(<= main_~j~0 2)} assume !!(~j~0 < 8); {3396#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:12,338 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-11 02:31:12,338 INFO L280 TraceCheckUtils]: 44: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,339 INFO L280 TraceCheckUtils]: 45: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,339 INFO L280 TraceCheckUtils]: 46: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,339 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #71#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:12,340 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-11 02:31:12,340 INFO L280 TraceCheckUtils]: 49: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,340 INFO L280 TraceCheckUtils]: 50: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,340 INFO L280 TraceCheckUtils]: 51: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,341 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3372#true} {3396#(<= main_~j~0 2)} #73#return; {3396#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:12,341 INFO L280 TraceCheckUtils]: 53: Hoare triple {3396#(<= main_~j~0 2)} #t~post2 := ~j~0; {3405#(<= |main_#t~post2| 2)} is VALID [2020-07-11 02:31:12,342 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-11 02:31:12,343 INFO L280 TraceCheckUtils]: 55: Hoare triple {3406#(<= main_~j~0 3)} havoc #t~post2; {3406#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:12,344 INFO L280 TraceCheckUtils]: 56: Hoare triple {3406#(<= main_~j~0 3)} assume !!(~j~0 < 8); {3406#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:12,344 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-11 02:31:12,344 INFO L280 TraceCheckUtils]: 58: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,344 INFO L280 TraceCheckUtils]: 59: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,344 INFO L280 TraceCheckUtils]: 60: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,346 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #71#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:12,346 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-11 02:31:12,346 INFO L280 TraceCheckUtils]: 63: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,346 INFO L280 TraceCheckUtils]: 64: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,346 INFO L280 TraceCheckUtils]: 65: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,347 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3372#true} {3406#(<= main_~j~0 3)} #73#return; {3406#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:12,348 INFO L280 TraceCheckUtils]: 67: Hoare triple {3406#(<= main_~j~0 3)} #t~post2 := ~j~0; {3415#(<= |main_#t~post2| 3)} is VALID [2020-07-11 02:31:12,349 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-11 02:31:12,349 INFO L280 TraceCheckUtils]: 69: Hoare triple {3416#(<= main_~j~0 4)} havoc #t~post2; {3416#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:12,350 INFO L280 TraceCheckUtils]: 70: Hoare triple {3416#(<= main_~j~0 4)} assume !!(~j~0 < 8); {3416#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:12,350 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-11 02:31:12,350 INFO L280 TraceCheckUtils]: 72: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,350 INFO L280 TraceCheckUtils]: 73: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,351 INFO L280 TraceCheckUtils]: 74: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,352 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #71#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:12,352 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-11 02:31:12,352 INFO L280 TraceCheckUtils]: 77: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,352 INFO L280 TraceCheckUtils]: 78: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,352 INFO L280 TraceCheckUtils]: 79: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,353 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {3372#true} {3416#(<= main_~j~0 4)} #73#return; {3416#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:12,353 INFO L280 TraceCheckUtils]: 81: Hoare triple {3416#(<= main_~j~0 4)} #t~post2 := ~j~0; {3425#(<= |main_#t~post2| 4)} is VALID [2020-07-11 02:31:12,354 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-11 02:31:12,354 INFO L280 TraceCheckUtils]: 83: Hoare triple {3426#(<= main_~j~0 5)} havoc #t~post2; {3426#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:12,355 INFO L280 TraceCheckUtils]: 84: Hoare triple {3426#(<= main_~j~0 5)} assume !(~j~0 < 8); {3373#false} is VALID [2020-07-11 02:31:12,355 INFO L280 TraceCheckUtils]: 85: Hoare triple {3373#false} #t~post1 := ~i~0; {3373#false} is VALID [2020-07-11 02:31:12,355 INFO L280 TraceCheckUtils]: 86: Hoare triple {3373#false} ~i~0 := 1 + #t~post1; {3373#false} is VALID [2020-07-11 02:31:12,355 INFO L280 TraceCheckUtils]: 87: Hoare triple {3373#false} havoc #t~post1; {3373#false} is VALID [2020-07-11 02:31:12,355 INFO L280 TraceCheckUtils]: 88: Hoare triple {3373#false} assume !!(~i~0 < ~nlen~0); {3373#false} is VALID [2020-07-11 02:31:12,355 INFO L280 TraceCheckUtils]: 89: Hoare triple {3373#false} ~j~0 := 0; {3373#false} is VALID [2020-07-11 02:31:12,356 INFO L280 TraceCheckUtils]: 90: Hoare triple {3373#false} assume !!(~j~0 < 8); {3373#false} is VALID [2020-07-11 02:31:12,356 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-11 02:31:12,356 INFO L280 TraceCheckUtils]: 92: Hoare triple {3372#true} ~cond := #in~cond; {3372#true} is VALID [2020-07-11 02:31:12,356 INFO L280 TraceCheckUtils]: 93: Hoare triple {3372#true} assume !(0 == ~cond); {3372#true} is VALID [2020-07-11 02:31:12,356 INFO L280 TraceCheckUtils]: 94: Hoare triple {3372#true} assume true; {3372#true} is VALID [2020-07-11 02:31:12,356 INFO L275 TraceCheckUtils]: 95: Hoare quadruple {3372#true} {3373#false} #71#return; {3373#false} is VALID [2020-07-11 02:31:12,356 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-11 02:31:12,357 INFO L280 TraceCheckUtils]: 97: Hoare triple {3373#false} ~cond := #in~cond; {3373#false} is VALID [2020-07-11 02:31:12,357 INFO L280 TraceCheckUtils]: 98: Hoare triple {3373#false} assume 0 == ~cond; {3373#false} is VALID [2020-07-11 02:31:12,357 INFO L280 TraceCheckUtils]: 99: Hoare triple {3373#false} assume !false; {3373#false} is VALID [2020-07-11 02:31:12,364 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-11 02:31:12,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [449830704] [2020-07-11 02:31:12,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:12,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:31:12,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256867545] [2020-07-11 02:31:12,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2020-07-11 02:31:12,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:12,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:31:12,439 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-11 02:31:12,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:31:12,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:12,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:31:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:31:12,441 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 13 states. [2020-07-11 02:31:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:13,115 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2020-07-11 02:31:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:31:13,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2020-07-11 02:31:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:31:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2020-07-11 02:31:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:31:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2020-07-11 02:31:13,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 98 transitions. [2020-07-11 02:31:13,230 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-11 02:31:13,234 INFO L225 Difference]: With dead ends: 161 [2020-07-11 02:31:13,235 INFO L226 Difference]: Without dead ends: 115 [2020-07-11 02:31:13,236 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-11 02:31:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-11 02:31:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2020-07-11 02:31:13,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:13,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 107 states. [2020-07-11 02:31:13,439 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 107 states. [2020-07-11 02:31:13,439 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 107 states. [2020-07-11 02:31:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:13,449 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2020-07-11 02:31:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2020-07-11 02:31:13,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:13,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:13,454 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 115 states. [2020-07-11 02:31:13,454 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 115 states. [2020-07-11 02:31:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:13,463 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2020-07-11 02:31:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2020-07-11 02:31:13,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:13,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:13,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:13,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-11 02:31:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2020-07-11 02:31:13,474 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 100 [2020-07-11 02:31:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:13,475 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2020-07-11 02:31:13,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:31:13,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 130 transitions. [2020-07-11 02:31:13,644 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-11 02:31:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2020-07-11 02:31:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-07-11 02:31:13,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:13,647 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-11 02:31:13,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:31:13,647 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1615510489, now seen corresponding path program 6 times [2020-07-11 02:31:13,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:13,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188693971] [2020-07-11 02:31:13,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,834 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,834 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4219#true} {4219#true} #67#return; {4219#true} is VALID [2020-07-11 02:31:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,850 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #71#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,858 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #73#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,881 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #71#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,891 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,892 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #73#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,898 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,900 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #71#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,906 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #73#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,913 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #71#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #73#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,926 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #71#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,931 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #73#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,936 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #71#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,940 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,940 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #73#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:13,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,944 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4220#false} #71#return; {4220#false} is VALID [2020-07-11 02:31:13,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2020-07-11 02:31:13,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,945 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4219#true} {4219#true} #67#return; {4219#true} is VALID [2020-07-11 02:31:13,945 INFO L263 TraceCheckUtils]: 3: Hoare triple {4219#true} call #t~ret3 := main(); {4219#true} is VALID [2020-07-11 02:31:13,945 INFO L280 TraceCheckUtils]: 4: Hoare triple {4219#true} havoc ~offset~0; {4219#true} is VALID [2020-07-11 02:31:13,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {4219#true} havoc ~length~0; {4219#true} is VALID [2020-07-11 02:31:13,946 INFO L280 TraceCheckUtils]: 6: Hoare triple {4219#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4219#true} is VALID [2020-07-11 02:31:13,946 INFO L280 TraceCheckUtils]: 7: Hoare triple {4219#true} ~nlen~0 := #t~nondet0; {4219#true} is VALID [2020-07-11 02:31:13,946 INFO L280 TraceCheckUtils]: 8: Hoare triple {4219#true} havoc #t~nondet0; {4219#true} is VALID [2020-07-11 02:31:13,946 INFO L280 TraceCheckUtils]: 9: Hoare triple {4219#true} havoc ~i~0; {4219#true} is VALID [2020-07-11 02:31:13,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {4219#true} havoc ~j~0; {4219#true} is VALID [2020-07-11 02:31:13,947 INFO L280 TraceCheckUtils]: 11: Hoare triple {4219#true} ~i~0 := 0; {4219#true} is VALID [2020-07-11 02:31:13,947 INFO L280 TraceCheckUtils]: 12: Hoare triple {4219#true} assume !!(~i~0 < ~nlen~0); {4219#true} is VALID [2020-07-11 02:31:13,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {4219#true} ~j~0 := 0; {4223#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:13,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {4223#(<= main_~j~0 0)} assume !!(~j~0 < 8); {4223#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:13,948 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-11 02:31:13,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,949 INFO L280 TraceCheckUtils]: 17: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,949 INFO L280 TraceCheckUtils]: 18: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,949 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #71#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:13,950 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-11 02:31:13,950 INFO L280 TraceCheckUtils]: 21: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,950 INFO L280 TraceCheckUtils]: 22: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,950 INFO L280 TraceCheckUtils]: 23: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,951 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4219#true} {4223#(<= main_~j~0 0)} #73#return; {4223#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:13,951 INFO L280 TraceCheckUtils]: 25: Hoare triple {4223#(<= main_~j~0 0)} #t~post2 := ~j~0; {4232#(<= |main_#t~post2| 0)} is VALID [2020-07-11 02:31:13,952 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-11 02:31:13,953 INFO L280 TraceCheckUtils]: 27: Hoare triple {4233#(<= main_~j~0 1)} havoc #t~post2; {4233#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:13,953 INFO L280 TraceCheckUtils]: 28: Hoare triple {4233#(<= main_~j~0 1)} assume !!(~j~0 < 8); {4233#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:13,953 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-11 02:31:13,954 INFO L280 TraceCheckUtils]: 30: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,954 INFO L280 TraceCheckUtils]: 31: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,954 INFO L280 TraceCheckUtils]: 32: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,955 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #71#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:13,955 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-11 02:31:13,955 INFO L280 TraceCheckUtils]: 35: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,955 INFO L280 TraceCheckUtils]: 36: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,955 INFO L280 TraceCheckUtils]: 37: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,956 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4219#true} {4233#(<= main_~j~0 1)} #73#return; {4233#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:13,957 INFO L280 TraceCheckUtils]: 39: Hoare triple {4233#(<= main_~j~0 1)} #t~post2 := ~j~0; {4242#(<= |main_#t~post2| 1)} is VALID [2020-07-11 02:31:13,957 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-11 02:31:13,958 INFO L280 TraceCheckUtils]: 41: Hoare triple {4243#(<= main_~j~0 2)} havoc #t~post2; {4243#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:13,958 INFO L280 TraceCheckUtils]: 42: Hoare triple {4243#(<= main_~j~0 2)} assume !!(~j~0 < 8); {4243#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:13,959 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-11 02:31:13,959 INFO L280 TraceCheckUtils]: 44: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,959 INFO L280 TraceCheckUtils]: 45: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,959 INFO L280 TraceCheckUtils]: 46: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,960 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #71#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:13,960 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-11 02:31:13,960 INFO L280 TraceCheckUtils]: 49: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,961 INFO L280 TraceCheckUtils]: 50: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,961 INFO L280 TraceCheckUtils]: 51: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,962 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4219#true} {4243#(<= main_~j~0 2)} #73#return; {4243#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:13,962 INFO L280 TraceCheckUtils]: 53: Hoare triple {4243#(<= main_~j~0 2)} #t~post2 := ~j~0; {4252#(<= |main_#t~post2| 2)} is VALID [2020-07-11 02:31:13,963 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-11 02:31:13,964 INFO L280 TraceCheckUtils]: 55: Hoare triple {4253#(<= main_~j~0 3)} havoc #t~post2; {4253#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:13,964 INFO L280 TraceCheckUtils]: 56: Hoare triple {4253#(<= main_~j~0 3)} assume !!(~j~0 < 8); {4253#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:13,964 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-11 02:31:13,964 INFO L280 TraceCheckUtils]: 58: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,965 INFO L280 TraceCheckUtils]: 59: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,965 INFO L280 TraceCheckUtils]: 60: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,966 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #71#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:13,966 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-11 02:31:13,966 INFO L280 TraceCheckUtils]: 63: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,966 INFO L280 TraceCheckUtils]: 64: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,966 INFO L280 TraceCheckUtils]: 65: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,967 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {4219#true} {4253#(<= main_~j~0 3)} #73#return; {4253#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:13,968 INFO L280 TraceCheckUtils]: 67: Hoare triple {4253#(<= main_~j~0 3)} #t~post2 := ~j~0; {4262#(<= |main_#t~post2| 3)} is VALID [2020-07-11 02:31:13,969 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-11 02:31:13,969 INFO L280 TraceCheckUtils]: 69: Hoare triple {4263#(<= main_~j~0 4)} havoc #t~post2; {4263#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:13,970 INFO L280 TraceCheckUtils]: 70: Hoare triple {4263#(<= main_~j~0 4)} assume !!(~j~0 < 8); {4263#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:13,970 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-11 02:31:13,970 INFO L280 TraceCheckUtils]: 72: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,970 INFO L280 TraceCheckUtils]: 73: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,971 INFO L280 TraceCheckUtils]: 74: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,971 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #71#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:13,971 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-11 02:31:13,972 INFO L280 TraceCheckUtils]: 77: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,972 INFO L280 TraceCheckUtils]: 78: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,972 INFO L280 TraceCheckUtils]: 79: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,973 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {4219#true} {4263#(<= main_~j~0 4)} #73#return; {4263#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:13,973 INFO L280 TraceCheckUtils]: 81: Hoare triple {4263#(<= main_~j~0 4)} #t~post2 := ~j~0; {4272#(<= |main_#t~post2| 4)} is VALID [2020-07-11 02:31:13,974 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-11 02:31:13,975 INFO L280 TraceCheckUtils]: 83: Hoare triple {4273#(<= main_~j~0 5)} havoc #t~post2; {4273#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:13,975 INFO L280 TraceCheckUtils]: 84: Hoare triple {4273#(<= main_~j~0 5)} assume !!(~j~0 < 8); {4273#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:13,976 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-11 02:31:13,976 INFO L280 TraceCheckUtils]: 86: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,976 INFO L280 TraceCheckUtils]: 87: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,976 INFO L280 TraceCheckUtils]: 88: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,977 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #71#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:13,977 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-11 02:31:13,977 INFO L280 TraceCheckUtils]: 91: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,977 INFO L280 TraceCheckUtils]: 92: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,978 INFO L280 TraceCheckUtils]: 93: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,978 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {4219#true} {4273#(<= main_~j~0 5)} #73#return; {4273#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:13,979 INFO L280 TraceCheckUtils]: 95: Hoare triple {4273#(<= main_~j~0 5)} #t~post2 := ~j~0; {4282#(<= |main_#t~post2| 5)} is VALID [2020-07-11 02:31:13,980 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-11 02:31:13,980 INFO L280 TraceCheckUtils]: 97: Hoare triple {4283#(<= main_~j~0 6)} havoc #t~post2; {4283#(<= main_~j~0 6)} is VALID [2020-07-11 02:31:13,981 INFO L280 TraceCheckUtils]: 98: Hoare triple {4283#(<= main_~j~0 6)} assume !(~j~0 < 8); {4220#false} is VALID [2020-07-11 02:31:13,981 INFO L280 TraceCheckUtils]: 99: Hoare triple {4220#false} #t~post1 := ~i~0; {4220#false} is VALID [2020-07-11 02:31:13,981 INFO L280 TraceCheckUtils]: 100: Hoare triple {4220#false} ~i~0 := 1 + #t~post1; {4220#false} is VALID [2020-07-11 02:31:13,981 INFO L280 TraceCheckUtils]: 101: Hoare triple {4220#false} havoc #t~post1; {4220#false} is VALID [2020-07-11 02:31:13,982 INFO L280 TraceCheckUtils]: 102: Hoare triple {4220#false} assume !!(~i~0 < ~nlen~0); {4220#false} is VALID [2020-07-11 02:31:13,982 INFO L280 TraceCheckUtils]: 103: Hoare triple {4220#false} ~j~0 := 0; {4220#false} is VALID [2020-07-11 02:31:13,982 INFO L280 TraceCheckUtils]: 104: Hoare triple {4220#false} assume !!(~j~0 < 8); {4220#false} is VALID [2020-07-11 02:31:13,982 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-11 02:31:13,982 INFO L280 TraceCheckUtils]: 106: Hoare triple {4219#true} ~cond := #in~cond; {4219#true} is VALID [2020-07-11 02:31:13,983 INFO L280 TraceCheckUtils]: 107: Hoare triple {4219#true} assume !(0 == ~cond); {4219#true} is VALID [2020-07-11 02:31:13,983 INFO L280 TraceCheckUtils]: 108: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-11 02:31:13,983 INFO L275 TraceCheckUtils]: 109: Hoare quadruple {4219#true} {4220#false} #71#return; {4220#false} is VALID [2020-07-11 02:31:13,983 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-11 02:31:13,983 INFO L280 TraceCheckUtils]: 111: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2020-07-11 02:31:13,983 INFO L280 TraceCheckUtils]: 112: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2020-07-11 02:31:13,984 INFO L280 TraceCheckUtils]: 113: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2020-07-11 02:31:13,992 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-11 02:31:13,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188693971] [2020-07-11 02:31:13,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:13,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 02:31:13,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240978218] [2020-07-11 02:31:13,993 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 114 [2020-07-11 02:31:13,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:13,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 02:31:14,072 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-11 02:31:14,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 02:31:14,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 02:31:14,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:31:14,074 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 15 states. [2020-07-11 02:31:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:14,897 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2020-07-11 02:31:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 02:31:14,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 114 [2020-07-11 02:31:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:31:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 106 transitions. [2020-07-11 02:31:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:31:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 106 transitions. [2020-07-11 02:31:14,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 106 transitions. [2020-07-11 02:31:15,057 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-11 02:31:15,062 INFO L225 Difference]: With dead ends: 179 [2020-07-11 02:31:15,062 INFO L226 Difference]: Without dead ends: 127 [2020-07-11 02:31:15,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2020-07-11 02:31:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-11 02:31:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-07-11 02:31:15,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:15,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 119 states. [2020-07-11 02:31:15,303 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 119 states. [2020-07-11 02:31:15,303 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 119 states. [2020-07-11 02:31:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:15,309 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2020-07-11 02:31:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2020-07-11 02:31:15,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:15,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:15,310 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 127 states. [2020-07-11 02:31:15,310 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 127 states. [2020-07-11 02:31:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:15,315 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2020-07-11 02:31:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2020-07-11 02:31:15,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:15,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:15,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:15,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-11 02:31:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2020-07-11 02:31:15,321 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 114 [2020-07-11 02:31:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:15,321 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2020-07-11 02:31:15,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 02:31:15,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 146 transitions. [2020-07-11 02:31:15,514 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-11 02:31:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2020-07-11 02:31:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-07-11 02:31:15,516 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:15,516 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-11 02:31:15,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:31:15,516 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:15,517 INFO L82 PathProgramCache]: Analyzing trace with hash 724624314, now seen corresponding path program 7 times [2020-07-11 02:31:15,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:15,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1877521761] [2020-07-11 02:31:15,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,805 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5164#true} {5164#true} #67#return; {5164#true} is VALID [2020-07-11 02:31:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,812 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,821 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #71#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,829 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #73#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,834 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #71#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,839 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #73#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,844 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #71#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,852 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #73#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,881 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #71#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,887 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #73#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,900 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #71#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,907 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #73#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,915 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #71#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,923 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #73#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,932 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #71#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-11 02:31:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,937 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,937 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,938 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #73#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-11 02:31:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:15,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,946 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5164#true} {5165#false} #71#return; {5165#false} is VALID [2020-07-11 02:31:15,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {5164#true} call ULTIMATE.init(); {5164#true} is VALID [2020-07-11 02:31:15,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,947 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5164#true} {5164#true} #67#return; {5164#true} is VALID [2020-07-11 02:31:15,948 INFO L263 TraceCheckUtils]: 3: Hoare triple {5164#true} call #t~ret3 := main(); {5164#true} is VALID [2020-07-11 02:31:15,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {5164#true} havoc ~offset~0; {5164#true} is VALID [2020-07-11 02:31:15,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {5164#true} havoc ~length~0; {5164#true} is VALID [2020-07-11 02:31:15,948 INFO L280 TraceCheckUtils]: 6: Hoare triple {5164#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5164#true} is VALID [2020-07-11 02:31:15,949 INFO L280 TraceCheckUtils]: 7: Hoare triple {5164#true} ~nlen~0 := #t~nondet0; {5164#true} is VALID [2020-07-11 02:31:15,949 INFO L280 TraceCheckUtils]: 8: Hoare triple {5164#true} havoc #t~nondet0; {5164#true} is VALID [2020-07-11 02:31:15,949 INFO L280 TraceCheckUtils]: 9: Hoare triple {5164#true} havoc ~i~0; {5164#true} is VALID [2020-07-11 02:31:15,949 INFO L280 TraceCheckUtils]: 10: Hoare triple {5164#true} havoc ~j~0; {5164#true} is VALID [2020-07-11 02:31:15,950 INFO L280 TraceCheckUtils]: 11: Hoare triple {5164#true} ~i~0 := 0; {5164#true} is VALID [2020-07-11 02:31:15,950 INFO L280 TraceCheckUtils]: 12: Hoare triple {5164#true} assume !!(~i~0 < ~nlen~0); {5164#true} is VALID [2020-07-11 02:31:15,951 INFO L280 TraceCheckUtils]: 13: Hoare triple {5164#true} ~j~0 := 0; {5168#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:15,952 INFO L280 TraceCheckUtils]: 14: Hoare triple {5168#(<= main_~j~0 0)} assume !!(~j~0 < 8); {5168#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:15,952 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-11 02:31:15,952 INFO L280 TraceCheckUtils]: 16: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,953 INFO L280 TraceCheckUtils]: 17: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,953 INFO L280 TraceCheckUtils]: 18: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,953 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #71#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:15,954 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-11 02:31:15,954 INFO L280 TraceCheckUtils]: 21: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,954 INFO L280 TraceCheckUtils]: 22: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,954 INFO L280 TraceCheckUtils]: 23: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,955 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {5164#true} {5168#(<= main_~j~0 0)} #73#return; {5168#(<= main_~j~0 0)} is VALID [2020-07-11 02:31:15,955 INFO L280 TraceCheckUtils]: 25: Hoare triple {5168#(<= main_~j~0 0)} #t~post2 := ~j~0; {5177#(<= |main_#t~post2| 0)} is VALID [2020-07-11 02:31:15,956 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-11 02:31:15,957 INFO L280 TraceCheckUtils]: 27: Hoare triple {5178#(<= main_~j~0 1)} havoc #t~post2; {5178#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:15,957 INFO L280 TraceCheckUtils]: 28: Hoare triple {5178#(<= main_~j~0 1)} assume !!(~j~0 < 8); {5178#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:15,957 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-11 02:31:15,958 INFO L280 TraceCheckUtils]: 30: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,958 INFO L280 TraceCheckUtils]: 31: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,958 INFO L280 TraceCheckUtils]: 32: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,960 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #71#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:15,960 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-11 02:31:15,960 INFO L280 TraceCheckUtils]: 35: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,960 INFO L280 TraceCheckUtils]: 36: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,960 INFO L280 TraceCheckUtils]: 37: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,961 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {5164#true} {5178#(<= main_~j~0 1)} #73#return; {5178#(<= main_~j~0 1)} is VALID [2020-07-11 02:31:15,961 INFO L280 TraceCheckUtils]: 39: Hoare triple {5178#(<= main_~j~0 1)} #t~post2 := ~j~0; {5187#(<= |main_#t~post2| 1)} is VALID [2020-07-11 02:31:15,962 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-11 02:31:15,963 INFO L280 TraceCheckUtils]: 41: Hoare triple {5188#(<= main_~j~0 2)} havoc #t~post2; {5188#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:15,963 INFO L280 TraceCheckUtils]: 42: Hoare triple {5188#(<= main_~j~0 2)} assume !!(~j~0 < 8); {5188#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:15,963 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-11 02:31:15,963 INFO L280 TraceCheckUtils]: 44: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,964 INFO L280 TraceCheckUtils]: 45: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,964 INFO L280 TraceCheckUtils]: 46: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,965 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #71#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:15,965 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-11 02:31:15,965 INFO L280 TraceCheckUtils]: 49: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,965 INFO L280 TraceCheckUtils]: 50: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,965 INFO L280 TraceCheckUtils]: 51: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,966 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {5164#true} {5188#(<= main_~j~0 2)} #73#return; {5188#(<= main_~j~0 2)} is VALID [2020-07-11 02:31:15,966 INFO L280 TraceCheckUtils]: 53: Hoare triple {5188#(<= main_~j~0 2)} #t~post2 := ~j~0; {5197#(<= |main_#t~post2| 2)} is VALID [2020-07-11 02:31:15,967 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-11 02:31:15,968 INFO L280 TraceCheckUtils]: 55: Hoare triple {5198#(<= main_~j~0 3)} havoc #t~post2; {5198#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:15,968 INFO L280 TraceCheckUtils]: 56: Hoare triple {5198#(<= main_~j~0 3)} assume !!(~j~0 < 8); {5198#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:15,968 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-11 02:31:15,968 INFO L280 TraceCheckUtils]: 58: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,969 INFO L280 TraceCheckUtils]: 59: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,969 INFO L280 TraceCheckUtils]: 60: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,970 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #71#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:15,970 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-11 02:31:15,970 INFO L280 TraceCheckUtils]: 63: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,970 INFO L280 TraceCheckUtils]: 64: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,970 INFO L280 TraceCheckUtils]: 65: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,971 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {5164#true} {5198#(<= main_~j~0 3)} #73#return; {5198#(<= main_~j~0 3)} is VALID [2020-07-11 02:31:15,972 INFO L280 TraceCheckUtils]: 67: Hoare triple {5198#(<= main_~j~0 3)} #t~post2 := ~j~0; {5207#(<= |main_#t~post2| 3)} is VALID [2020-07-11 02:31:15,973 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-11 02:31:15,973 INFO L280 TraceCheckUtils]: 69: Hoare triple {5208#(<= main_~j~0 4)} havoc #t~post2; {5208#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:15,974 INFO L280 TraceCheckUtils]: 70: Hoare triple {5208#(<= main_~j~0 4)} assume !!(~j~0 < 8); {5208#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:15,974 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-11 02:31:15,974 INFO L280 TraceCheckUtils]: 72: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,974 INFO L280 TraceCheckUtils]: 73: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,975 INFO L280 TraceCheckUtils]: 74: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,975 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #71#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:15,976 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-11 02:31:15,976 INFO L280 TraceCheckUtils]: 77: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,976 INFO L280 TraceCheckUtils]: 78: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,976 INFO L280 TraceCheckUtils]: 79: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,977 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {5164#true} {5208#(<= main_~j~0 4)} #73#return; {5208#(<= main_~j~0 4)} is VALID [2020-07-11 02:31:15,978 INFO L280 TraceCheckUtils]: 81: Hoare triple {5208#(<= main_~j~0 4)} #t~post2 := ~j~0; {5217#(<= |main_#t~post2| 4)} is VALID [2020-07-11 02:31:15,979 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-11 02:31:15,979 INFO L280 TraceCheckUtils]: 83: Hoare triple {5218#(<= main_~j~0 5)} havoc #t~post2; {5218#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:15,980 INFO L280 TraceCheckUtils]: 84: Hoare triple {5218#(<= main_~j~0 5)} assume !!(~j~0 < 8); {5218#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:15,980 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-11 02:31:15,980 INFO L280 TraceCheckUtils]: 86: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,981 INFO L280 TraceCheckUtils]: 87: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,981 INFO L280 TraceCheckUtils]: 88: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,982 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #71#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:15,982 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-11 02:31:15,982 INFO L280 TraceCheckUtils]: 91: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,982 INFO L280 TraceCheckUtils]: 92: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,982 INFO L280 TraceCheckUtils]: 93: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,985 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {5164#true} {5218#(<= main_~j~0 5)} #73#return; {5218#(<= main_~j~0 5)} is VALID [2020-07-11 02:31:15,985 INFO L280 TraceCheckUtils]: 95: Hoare triple {5218#(<= main_~j~0 5)} #t~post2 := ~j~0; {5227#(<= |main_#t~post2| 5)} is VALID [2020-07-11 02:31:15,986 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-11 02:31:15,986 INFO L280 TraceCheckUtils]: 97: Hoare triple {5228#(<= main_~j~0 6)} havoc #t~post2; {5228#(<= main_~j~0 6)} is VALID [2020-07-11 02:31:15,987 INFO L280 TraceCheckUtils]: 98: Hoare triple {5228#(<= main_~j~0 6)} assume !!(~j~0 < 8); {5228#(<= main_~j~0 6)} is VALID [2020-07-11 02:31:15,987 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-11 02:31:15,987 INFO L280 TraceCheckUtils]: 100: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,987 INFO L280 TraceCheckUtils]: 101: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,988 INFO L280 TraceCheckUtils]: 102: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,988 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #71#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-11 02:31:15,989 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-11 02:31:15,989 INFO L280 TraceCheckUtils]: 105: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,989 INFO L280 TraceCheckUtils]: 106: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,989 INFO L280 TraceCheckUtils]: 107: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,990 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {5164#true} {5228#(<= main_~j~0 6)} #73#return; {5228#(<= main_~j~0 6)} is VALID [2020-07-11 02:31:15,990 INFO L280 TraceCheckUtils]: 109: Hoare triple {5228#(<= main_~j~0 6)} #t~post2 := ~j~0; {5237#(<= |main_#t~post2| 6)} is VALID [2020-07-11 02:31:15,991 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-11 02:31:15,991 INFO L280 TraceCheckUtils]: 111: Hoare triple {5238#(<= main_~j~0 7)} havoc #t~post2; {5238#(<= main_~j~0 7)} is VALID [2020-07-11 02:31:15,992 INFO L280 TraceCheckUtils]: 112: Hoare triple {5238#(<= main_~j~0 7)} assume !(~j~0 < 8); {5165#false} is VALID [2020-07-11 02:31:15,992 INFO L280 TraceCheckUtils]: 113: Hoare triple {5165#false} #t~post1 := ~i~0; {5165#false} is VALID [2020-07-11 02:31:15,992 INFO L280 TraceCheckUtils]: 114: Hoare triple {5165#false} ~i~0 := 1 + #t~post1; {5165#false} is VALID [2020-07-11 02:31:15,993 INFO L280 TraceCheckUtils]: 115: Hoare triple {5165#false} havoc #t~post1; {5165#false} is VALID [2020-07-11 02:31:15,993 INFO L280 TraceCheckUtils]: 116: Hoare triple {5165#false} assume !!(~i~0 < ~nlen~0); {5165#false} is VALID [2020-07-11 02:31:15,993 INFO L280 TraceCheckUtils]: 117: Hoare triple {5165#false} ~j~0 := 0; {5165#false} is VALID [2020-07-11 02:31:15,993 INFO L280 TraceCheckUtils]: 118: Hoare triple {5165#false} assume !!(~j~0 < 8); {5165#false} is VALID [2020-07-11 02:31:15,993 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-11 02:31:15,993 INFO L280 TraceCheckUtils]: 120: Hoare triple {5164#true} ~cond := #in~cond; {5164#true} is VALID [2020-07-11 02:31:15,994 INFO L280 TraceCheckUtils]: 121: Hoare triple {5164#true} assume !(0 == ~cond); {5164#true} is VALID [2020-07-11 02:31:15,994 INFO L280 TraceCheckUtils]: 122: Hoare triple {5164#true} assume true; {5164#true} is VALID [2020-07-11 02:31:15,994 INFO L275 TraceCheckUtils]: 123: Hoare quadruple {5164#true} {5165#false} #71#return; {5165#false} is VALID [2020-07-11 02:31:15,994 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-11 02:31:15,994 INFO L280 TraceCheckUtils]: 125: Hoare triple {5165#false} ~cond := #in~cond; {5165#false} is VALID [2020-07-11 02:31:15,995 INFO L280 TraceCheckUtils]: 126: Hoare triple {5165#false} assume 0 == ~cond; {5165#false} is VALID [2020-07-11 02:31:15,995 INFO L280 TraceCheckUtils]: 127: Hoare triple {5165#false} assume !false; {5165#false} is VALID [2020-07-11 02:31:16,006 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-11 02:31:16,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1877521761] [2020-07-11 02:31:16,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:16,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-11 02:31:16,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106026942] [2020-07-11 02:31:16,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2020-07-11 02:31:16,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:16,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-11 02:31:16,094 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-11 02:31:16,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-11 02:31:16,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-11 02:31:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:31:16,095 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand 17 states. [2020-07-11 02:31:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:16,954 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2020-07-11 02:31:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-11 02:31:16,955 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2020-07-11 02:31:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:31:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2020-07-11 02:31:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:31:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2020-07-11 02:31:16,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 108 transitions. [2020-07-11 02:31:17,077 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-11 02:31:17,081 INFO L225 Difference]: With dead ends: 189 [2020-07-11 02:31:17,081 INFO L226 Difference]: Without dead ends: 131 [2020-07-11 02:31:17,082 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-11 02:31:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-07-11 02:31:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-07-11 02:31:17,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:17,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 131 states. [2020-07-11 02:31:17,335 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 131 states. [2020-07-11 02:31:17,335 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 131 states. [2020-07-11 02:31:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:17,342 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2020-07-11 02:31:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2020-07-11 02:31:17,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:17,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:17,343 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 131 states. [2020-07-11 02:31:17,343 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 131 states. [2020-07-11 02:31:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:17,349 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2020-07-11 02:31:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2020-07-11 02:31:17,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:17,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:17,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:17,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-11 02:31:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2020-07-11 02:31:17,356 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 128 [2020-07-11 02:31:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:17,357 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2020-07-11 02:31:17,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-11 02:31:17,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 131 states and 162 transitions. [2020-07-11 02:31:17,578 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-11 02:31:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2020-07-11 02:31:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-11 02:31:17,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:17,581 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-11 02:31:17,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 02:31:17,582 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1386163675, now seen corresponding path program 8 times [2020-07-11 02:31:17,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:17,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196194926] [2020-07-11 02:31:17,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,706 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6175#true} {6175#true} #67#return; {6175#true} is VALID [2020-07-11 02:31:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,716 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,722 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,729 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,735 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,740 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,747 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,753 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,760 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,762 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,772 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,778 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,782 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,790 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,796 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,803 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,810 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:17,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,820 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6175#true} {6245#(<= 1 main_~i~0)} #71#return; {6245#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:17,820 INFO L263 TraceCheckUtils]: 0: Hoare triple {6175#true} call ULTIMATE.init(); {6175#true} is VALID [2020-07-11 02:31:17,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,821 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6175#true} {6175#true} #67#return; {6175#true} is VALID [2020-07-11 02:31:17,821 INFO L263 TraceCheckUtils]: 3: Hoare triple {6175#true} call #t~ret3 := main(); {6175#true} is VALID [2020-07-11 02:31:17,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {6175#true} havoc ~offset~0; {6175#true} is VALID [2020-07-11 02:31:17,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {6175#true} havoc ~length~0; {6175#true} is VALID [2020-07-11 02:31:17,822 INFO L280 TraceCheckUtils]: 6: Hoare triple {6175#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6175#true} is VALID [2020-07-11 02:31:17,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {6175#true} ~nlen~0 := #t~nondet0; {6175#true} is VALID [2020-07-11 02:31:17,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {6175#true} havoc #t~nondet0; {6175#true} is VALID [2020-07-11 02:31:17,823 INFO L280 TraceCheckUtils]: 9: Hoare triple {6175#true} havoc ~i~0; {6175#true} is VALID [2020-07-11 02:31:17,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {6175#true} havoc ~j~0; {6175#true} is VALID [2020-07-11 02:31:17,824 INFO L280 TraceCheckUtils]: 11: Hoare triple {6175#true} ~i~0 := 0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,825 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-11 02:31:17,825 INFO L280 TraceCheckUtils]: 13: Hoare triple {6179#(<= 0 main_~i~0)} ~j~0 := 0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,826 INFO L280 TraceCheckUtils]: 14: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,826 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-11 02:31:17,827 INFO L280 TraceCheckUtils]: 16: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,827 INFO L280 TraceCheckUtils]: 17: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,827 INFO L280 TraceCheckUtils]: 18: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,829 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,829 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-11 02:31:17,829 INFO L280 TraceCheckUtils]: 21: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,830 INFO L280 TraceCheckUtils]: 22: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,830 INFO L280 TraceCheckUtils]: 23: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,831 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,832 INFO L280 TraceCheckUtils]: 25: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,832 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-11 02:31:17,833 INFO L280 TraceCheckUtils]: 27: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,834 INFO L280 TraceCheckUtils]: 28: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,834 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-11 02:31:17,834 INFO L280 TraceCheckUtils]: 30: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,835 INFO L280 TraceCheckUtils]: 31: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,835 INFO L280 TraceCheckUtils]: 32: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,836 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,836 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-11 02:31:17,837 INFO L280 TraceCheckUtils]: 35: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,837 INFO L280 TraceCheckUtils]: 36: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,837 INFO L280 TraceCheckUtils]: 37: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,839 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,839 INFO L280 TraceCheckUtils]: 39: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,841 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-11 02:31:17,841 INFO L280 TraceCheckUtils]: 41: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,842 INFO L280 TraceCheckUtils]: 42: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,842 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-11 02:31:17,843 INFO L280 TraceCheckUtils]: 44: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,843 INFO L280 TraceCheckUtils]: 45: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,843 INFO L280 TraceCheckUtils]: 46: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,844 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,845 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-11 02:31:17,845 INFO L280 TraceCheckUtils]: 49: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,845 INFO L280 TraceCheckUtils]: 50: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,845 INFO L280 TraceCheckUtils]: 51: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,847 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,848 INFO L280 TraceCheckUtils]: 53: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,849 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-11 02:31:17,849 INFO L280 TraceCheckUtils]: 55: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,850 INFO L280 TraceCheckUtils]: 56: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,850 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-11 02:31:17,851 INFO L280 TraceCheckUtils]: 58: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,851 INFO L280 TraceCheckUtils]: 59: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,851 INFO L280 TraceCheckUtils]: 60: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,852 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,852 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-11 02:31:17,852 INFO L280 TraceCheckUtils]: 63: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,852 INFO L280 TraceCheckUtils]: 64: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,852 INFO L280 TraceCheckUtils]: 65: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,853 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,853 INFO L280 TraceCheckUtils]: 67: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,854 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-11 02:31:17,854 INFO L280 TraceCheckUtils]: 69: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,855 INFO L280 TraceCheckUtils]: 70: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,855 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-11 02:31:17,855 INFO L280 TraceCheckUtils]: 72: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,855 INFO L280 TraceCheckUtils]: 73: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,856 INFO L280 TraceCheckUtils]: 74: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,856 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,856 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-11 02:31:17,857 INFO L280 TraceCheckUtils]: 77: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,857 INFO L280 TraceCheckUtils]: 78: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,857 INFO L280 TraceCheckUtils]: 79: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,858 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,858 INFO L280 TraceCheckUtils]: 81: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,859 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-11 02:31:17,859 INFO L280 TraceCheckUtils]: 83: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,860 INFO L280 TraceCheckUtils]: 84: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,861 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-11 02:31:17,861 INFO L280 TraceCheckUtils]: 86: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,861 INFO L280 TraceCheckUtils]: 87: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,861 INFO L280 TraceCheckUtils]: 88: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,863 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,863 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-11 02:31:17,863 INFO L280 TraceCheckUtils]: 91: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,864 INFO L280 TraceCheckUtils]: 92: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,864 INFO L280 TraceCheckUtils]: 93: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,865 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,866 INFO L280 TraceCheckUtils]: 95: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,866 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-11 02:31:17,867 INFO L280 TraceCheckUtils]: 97: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,868 INFO L280 TraceCheckUtils]: 98: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,868 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-11 02:31:17,868 INFO L280 TraceCheckUtils]: 100: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,869 INFO L280 TraceCheckUtils]: 101: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,869 INFO L280 TraceCheckUtils]: 102: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,870 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,870 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-11 02:31:17,871 INFO L280 TraceCheckUtils]: 105: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,871 INFO L280 TraceCheckUtils]: 106: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,871 INFO L280 TraceCheckUtils]: 107: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,872 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,873 INFO L280 TraceCheckUtils]: 109: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,874 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-11 02:31:17,874 INFO L280 TraceCheckUtils]: 111: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,875 INFO L280 TraceCheckUtils]: 112: Hoare triple {6179#(<= 0 main_~i~0)} assume !!(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,875 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-11 02:31:17,876 INFO L280 TraceCheckUtils]: 114: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,876 INFO L280 TraceCheckUtils]: 115: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,876 INFO L280 TraceCheckUtils]: 116: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,878 INFO L275 TraceCheckUtils]: 117: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #71#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,879 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-11 02:31:17,879 INFO L280 TraceCheckUtils]: 119: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,879 INFO L280 TraceCheckUtils]: 120: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,879 INFO L280 TraceCheckUtils]: 121: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,881 INFO L275 TraceCheckUtils]: 122: Hoare quadruple {6175#true} {6179#(<= 0 main_~i~0)} #73#return; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,881 INFO L280 TraceCheckUtils]: 123: Hoare triple {6179#(<= 0 main_~i~0)} #t~post2 := ~j~0; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,882 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-11 02:31:17,883 INFO L280 TraceCheckUtils]: 125: Hoare triple {6179#(<= 0 main_~i~0)} havoc #t~post2; {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,884 INFO L280 TraceCheckUtils]: 126: Hoare triple {6179#(<= 0 main_~i~0)} assume !(~j~0 < 8); {6179#(<= 0 main_~i~0)} is VALID [2020-07-11 02:31:17,885 INFO L280 TraceCheckUtils]: 127: Hoare triple {6179#(<= 0 main_~i~0)} #t~post1 := ~i~0; {6244#(<= 0 |main_#t~post1|)} is VALID [2020-07-11 02:31:17,886 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-11 02:31:17,886 INFO L280 TraceCheckUtils]: 129: Hoare triple {6245#(<= 1 main_~i~0)} havoc #t~post1; {6245#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:17,887 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-11 02:31:17,888 INFO L280 TraceCheckUtils]: 131: Hoare triple {6245#(<= 1 main_~i~0)} ~j~0 := 0; {6245#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:17,889 INFO L280 TraceCheckUtils]: 132: Hoare triple {6245#(<= 1 main_~i~0)} assume !!(~j~0 < 8); {6245#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:17,889 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-11 02:31:17,889 INFO L280 TraceCheckUtils]: 134: Hoare triple {6175#true} ~cond := #in~cond; {6175#true} is VALID [2020-07-11 02:31:17,889 INFO L280 TraceCheckUtils]: 135: Hoare triple {6175#true} assume !(0 == ~cond); {6175#true} is VALID [2020-07-11 02:31:17,889 INFO L280 TraceCheckUtils]: 136: Hoare triple {6175#true} assume true; {6175#true} is VALID [2020-07-11 02:31:17,890 INFO L275 TraceCheckUtils]: 137: Hoare quadruple {6175#true} {6245#(<= 1 main_~i~0)} #71#return; {6245#(<= 1 main_~i~0)} is VALID [2020-07-11 02:31:17,892 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)); {6250#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:17,893 INFO L280 TraceCheckUtils]: 139: Hoare triple {6250#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6251#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:17,893 INFO L280 TraceCheckUtils]: 140: Hoare triple {6251#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6176#false} is VALID [2020-07-11 02:31:17,894 INFO L280 TraceCheckUtils]: 141: Hoare triple {6176#false} assume !false; {6176#false} is VALID [2020-07-11 02:31:17,918 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-11 02:31:17,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196194926] [2020-07-11 02:31:17,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:17,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:31:17,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105075459] [2020-07-11 02:31:17,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2020-07-11 02:31:17,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:17,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:31:17,968 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-11 02:31:17,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:31:17,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:17,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:31:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:31:17,970 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 7 states. [2020-07-11 02:31:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:18,488 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2020-07-11 02:31:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:31:18,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2020-07-11 02:31:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2020-07-11 02:31:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:31:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2020-07-11 02:31:18,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2020-07-11 02:31:18,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:18,536 INFO L225 Difference]: With dead ends: 133 [2020-07-11 02:31:18,536 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:31:18,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:31:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:31:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:31:18,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:18,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:18,539 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:18,539 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:18,539 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:18,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:18,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:18,540 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:18,540 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:18,540 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:18,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:18,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:18,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:18,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:31:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:31:18,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-11 02:31:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:18,543 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:31:18,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:31:18,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:31:18,543 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-11 02:31:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:18,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:18,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 02:31:18,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:31:19,571 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2020-07-11 02:31:19,732 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2020-07-11 02:31:20,047 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 12 [2020-07-11 02:31:20,269 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2020-07-11 02:31:20,321 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:20,321 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:20,321 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:20,321 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:31:20,321 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:31:20,321 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:20,322 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:20,322 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:20,322 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:31:20,322 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:31:20,322 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:20,322 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 23) the Hoare annotation is: true [2020-07-11 02:31:20,323 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-11 02:31:20,323 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-11 02:31:20,323 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 02:31:20,323 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 02:31:20,324 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-11 02:31:20,324 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-11 02:31:20,324 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 23) the Hoare annotation is: true [2020-07-11 02:31:20,324 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-11 02:31:20,324 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2020-07-11 02:31:20,325 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-11 02:31:20,325 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-11 02:31:20,325 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:31:20,325 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:31:20,325 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-11 02:31:20,325 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-11 02:31:20,325 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-11 02:31:20,326 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-11 02:31:20,326 INFO L271 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: true [2020-07-11 02:31:20,326 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-11 02:31:20,326 INFO L264 CegarLoopResult]: At program point L16-6(lines 16 21) the Hoare annotation is: (< 0 (+ main_~i~0 1)) [2020-07-11 02:31:20,326 INFO L271 CegarLoopResult]: At program point L16-7(lines 16 21) the Hoare annotation is: true [2020-07-11 02:31:20,326 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:31:20,326 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-11 02:31:20,327 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:31:20,327 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-11 02:31:20,327 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-11 02:31:20,327 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:31:20,331 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:31:20,337 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:31:20,337 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:31:20,342 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:31:20,342 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:31:20,356 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-11 02:31:20,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:31:20 BoogieIcfgContainer [2020-07-11 02:31:20,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:31:20,371 INFO L168 Benchmark]: Toolchain (without parser) took 15222.29 ms. Allocated memory was 135.3 MB in the beginning and 417.3 MB in the end (delta: 282.1 MB). Free memory was 100.6 MB in the beginning and 165.8 MB in the end (delta: -65.2 MB). Peak memory consumption was 216.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:20,372 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-11 02:31:20,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.89 ms. Allocated memory is still 135.3 MB. Free memory was 100.2 MB in the beginning and 90.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:20,373 INFO L168 Benchmark]: Boogie Preprocessor took 117.12 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 90.6 MB in the beginning and 179.3 MB in the end (delta: -88.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:20,373 INFO L168 Benchmark]: RCFGBuilder took 359.23 ms. Allocated memory is still 199.2 MB. Free memory was 179.3 MB in the beginning and 158.6 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:20,374 INFO L168 Benchmark]: TraceAbstraction took 14490.20 ms. Allocated memory was 199.2 MB in the beginning and 417.3 MB in the end (delta: 218.1 MB). Free memory was 158.6 MB in the beginning and 165.8 MB in the end (delta: -7.3 MB). Peak memory consumption was 210.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:20,377 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.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.89 ms. Allocated memory is still 135.3 MB. Free memory was 100.2 MB in the beginning and 90.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.12 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 90.6 MB in the beginning and 179.3 MB in the end (delta: -88.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.23 ms. Allocated memory is still 199.2 MB. Free memory was 179.3 MB in the beginning and 158.6 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14490.20 ms. Allocated memory was 199.2 MB in the beginning and 417.3 MB in the end (delta: 218.1 MB). Free memory was 158.6 MB in the beginning and 165.8 MB in the end (delta: -7.3 MB). Peak memory consumption was 210.8 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: 12.5s, OverallIterations: 11, TraceHistogramMax: 18, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 393 SDtfs, 131 SDslu, 1161 SDs, 0 SdLazy, 419 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.4s 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.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 580 PreInvPairs, 756 NumberOfFragments, 152 HoareAnnotationTreeSize, 580 FomulaSimplifications, 21629 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 34 FomulaSimplificationsInter, 10417 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 130448 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...