/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:38:20,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:38:20,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:38:20,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:38:20,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:38:20,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:38:20,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:38:20,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:38:20,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:38:20,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:38:20,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:38:20,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:38:20,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:38:20,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:38:20,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:38:20,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:38:20,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:38:20,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:38:20,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:38:20,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:38:20,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:38:20,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:38:20,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:38:20,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:38:20,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:38:20,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:38:20,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:38:20,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:38:20,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:38:20,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:38:20,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:38:20,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:38:20,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:38:20,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:38:20,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:38:20,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:38:20,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:38:20,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:38:20,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:38:20,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:38:20,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:38:20,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:38:20,844 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:38:20,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:38:20,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:38:20,849 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:38:20,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:38:20,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:38:20,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:38:20,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:38:20,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:38:20,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:38:20,852 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:38:20,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:38:20,852 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:38:20,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:38:20,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:38:20,853 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:38:20,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:38:20,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:38:20,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:38:20,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:38:20,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:38:20,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:38:20,854 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-10-24 02:38:21,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:38:21,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:38:21,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:38:21,327 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:38:21,327 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:38:21,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2020-10-24 02:38:21,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d4b3e66/16f4a9521a7e48b9a06ee7c7488f529a/FLAGe11f3850a [2020-10-24 02:38:22,094 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:38:22,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2020-10-24 02:38:22,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d4b3e66/16f4a9521a7e48b9a06ee7c7488f529a/FLAGe11f3850a [2020-10-24 02:38:22,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d4b3e66/16f4a9521a7e48b9a06ee7c7488f529a [2020-10-24 02:38:22,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:38:22,445 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:38:22,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:22,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:38:22,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:38:22,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12694d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22, skipping insertion in model container [2020-10-24 02:38:22,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:38:22,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:38:22,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:22,671 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:38:22,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:22,708 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:38:22,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22 WrapperNode [2020-10-24 02:38:22,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:22,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:38:22,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:38:22,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:38:22,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (1/1) ... [2020-10-24 02:38:22,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:38:22,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:38:22,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:38:22,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:38:22,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (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-10-24 02:38:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:38:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:38:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:38:22,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:38:22,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:38:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:38:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:38:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:38:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:38:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:38:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:38:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:38:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:38:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:38:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:38:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:38:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:38:23,421 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:38:23,422 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-24 02:38:23,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:23 BoogieIcfgContainer [2020-10-24 02:38:23,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:38:23,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:38:23,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:38:23,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:38:23,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:38:22" (1/3) ... [2020-10-24 02:38:23,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4373e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:23, skipping insertion in model container [2020-10-24 02:38:23,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:22" (2/3) ... [2020-10-24 02:38:23,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4373e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:23, skipping insertion in model container [2020-10-24 02:38:23,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:23" (3/3) ... [2020-10-24 02:38:23,441 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2020-10-24 02:38:23,454 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:38:23,461 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:38:23,481 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:38:23,522 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:38:23,522 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:38:23,522 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:38:23,522 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:38:23,522 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:38:23,523 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:38:23,523 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:38:23,523 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:38:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2020-10-24 02:38:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 02:38:23,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:23,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:23,562 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:23,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1350398460, now seen corresponding path program 1 times [2020-10-24 02:38:23,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:23,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1628322317] [2020-10-24 02:38:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:23,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:23,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1628322317] [2020-10-24 02:38:23,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:38:23,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 02:38:23,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493496769] [2020-10-24 02:38:23,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 02:38:23,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 02:38:24,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:38:24,011 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2020-10-24 02:38:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:24,142 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2020-10-24 02:38:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 02:38:24,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-10-24 02:38:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:24,155 INFO L225 Difference]: With dead ends: 95 [2020-10-24 02:38:24,155 INFO L226 Difference]: Without dead ends: 50 [2020-10-24 02:38:24,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-24 02:38:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-24 02:38:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-24 02:38:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-24 02:38:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-10-24 02:38:24,222 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2020-10-24 02:38:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:24,222 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-10-24 02:38:24,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 02:38:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-10-24 02:38:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 02:38:24,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:24,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:24,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:38:24,226 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1121365252, now seen corresponding path program 1 times [2020-10-24 02:38:24,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:24,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613475490] [2020-10-24 02:38:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:24,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:24,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613475490] [2020-10-24 02:38:24,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:38:24,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 02:38:24,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545776137] [2020-10-24 02:38:24,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 02:38:24,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 02:38:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 02:38:24,460 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2020-10-24 02:38:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:24,876 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2020-10-24 02:38:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 02:38:24,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-10-24 02:38:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:24,879 INFO L225 Difference]: With dead ends: 102 [2020-10-24 02:38:24,879 INFO L226 Difference]: Without dead ends: 70 [2020-10-24 02:38:24,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-24 02:38:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2020-10-24 02:38:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 02:38:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-10-24 02:38:24,902 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 32 [2020-10-24 02:38:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:24,903 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-10-24 02:38:24,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 02:38:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-10-24 02:38:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-24 02:38:24,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:24,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:24,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:38:24,906 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash -23964121, now seen corresponding path program 1 times [2020-10-24 02:38:24,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:24,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928146187] [2020-10-24 02:38:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:25,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:25,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928146187] [2020-10-24 02:38:25,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:25,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:38:25,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182316617] [2020-10-24 02:38:25,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:38:25,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:25,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:38:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:38:25,176 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-10-24 02:38:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:25,871 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2020-10-24 02:38:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:38:25,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-10-24 02:38:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:25,873 INFO L225 Difference]: With dead ends: 107 [2020-10-24 02:38:25,874 INFO L226 Difference]: Without dead ends: 74 [2020-10-24 02:38:25,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:38:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-24 02:38:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2020-10-24 02:38:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-24 02:38:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-10-24 02:38:25,897 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 36 [2020-10-24 02:38:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:25,897 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-10-24 02:38:25,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:38:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-10-24 02:38:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-24 02:38:25,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:25,899 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:25,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:38:25,900 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1270958646, now seen corresponding path program 2 times [2020-10-24 02:38:25,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:25,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [677885808] [2020-10-24 02:38:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:26,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:26,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [677885808] [2020-10-24 02:38:26,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:26,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:38:26,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764583316] [2020-10-24 02:38:26,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:38:26,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:38:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:38:26,137 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 8 states. [2020-10-24 02:38:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:26,772 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2020-10-24 02:38:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:38:26,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-10-24 02:38:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:26,774 INFO L225 Difference]: With dead ends: 115 [2020-10-24 02:38:26,775 INFO L226 Difference]: Without dead ends: 78 [2020-10-24 02:38:26,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:38:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-24 02:38:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2020-10-24 02:38:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 02:38:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-10-24 02:38:26,795 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 40 [2020-10-24 02:38:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:26,795 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-10-24 02:38:26,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:38:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-10-24 02:38:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-24 02:38:26,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:26,797 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:26,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:38:26,797 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:26,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash -140735507, now seen corresponding path program 3 times [2020-10-24 02:38:26,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:26,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1606765911] [2020-10-24 02:38:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:27,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:27,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1606765911] [2020-10-24 02:38:27,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:27,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:38:27,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138572824] [2020-10-24 02:38:27,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:38:27,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:27,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:38:27,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:38:27,029 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2020-10-24 02:38:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:27,953 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2020-10-24 02:38:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 02:38:27,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2020-10-24 02:38:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:27,956 INFO L225 Difference]: With dead ends: 123 [2020-10-24 02:38:27,957 INFO L226 Difference]: Without dead ends: 82 [2020-10-24 02:38:27,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:38:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-24 02:38:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2020-10-24 02:38:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 02:38:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-10-24 02:38:27,996 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 44 [2020-10-24 02:38:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:27,997 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-10-24 02:38:28,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:38:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-10-24 02:38:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-24 02:38:28,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:28,005 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:28,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:38:28,006 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash 235706512, now seen corresponding path program 4 times [2020-10-24 02:38:28,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:28,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253869065] [2020-10-24 02:38:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:28,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:28,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253869065] [2020-10-24 02:38:28,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:28,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:38:28,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061839688] [2020-10-24 02:38:28,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:38:28,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:38:28,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:38:28,326 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 12 states. [2020-10-24 02:38:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:29,325 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2020-10-24 02:38:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:38:29,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2020-10-24 02:38:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:29,327 INFO L225 Difference]: With dead ends: 131 [2020-10-24 02:38:29,327 INFO L226 Difference]: Without dead ends: 86 [2020-10-24 02:38:29,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2020-10-24 02:38:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-24 02:38:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2020-10-24 02:38:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 02:38:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-10-24 02:38:29,363 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 48 [2020-10-24 02:38:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:29,363 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-10-24 02:38:29,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:38:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-10-24 02:38:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 02:38:29,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:29,365 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:29,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:38:29,366 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash 512727987, now seen corresponding path program 5 times [2020-10-24 02:38:29,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:29,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586528415] [2020-10-24 02:38:29,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:29,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:29,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586528415] [2020-10-24 02:38:29,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:29,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 02:38:29,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532531152] [2020-10-24 02:38:29,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 02:38:29,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 02:38:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:38:29,689 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 14 states. [2020-10-24 02:38:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:31,000 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2020-10-24 02:38:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 02:38:31,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2020-10-24 02:38:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:31,003 INFO L225 Difference]: With dead ends: 139 [2020-10-24 02:38:31,003 INFO L226 Difference]: Without dead ends: 90 [2020-10-24 02:38:31,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:38:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-24 02:38:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2020-10-24 02:38:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-24 02:38:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2020-10-24 02:38:31,039 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 52 [2020-10-24 02:38:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:31,040 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-10-24 02:38:31,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 02:38:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2020-10-24 02:38:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-24 02:38:31,045 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:31,045 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:31,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:38:31,045 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:31,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1640387926, now seen corresponding path program 6 times [2020-10-24 02:38:31,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:31,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1058160698] [2020-10-24 02:38:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:31,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:31,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1058160698] [2020-10-24 02:38:31,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:31,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 02:38:31,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118798498] [2020-10-24 02:38:31,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 02:38:31,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 02:38:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:38:31,433 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 16 states. [2020-10-24 02:38:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:33,084 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2020-10-24 02:38:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:38:33,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2020-10-24 02:38:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:33,086 INFO L225 Difference]: With dead ends: 147 [2020-10-24 02:38:33,087 INFO L226 Difference]: Without dead ends: 94 [2020-10-24 02:38:33,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 02:38:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-24 02:38:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2020-10-24 02:38:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 02:38:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2020-10-24 02:38:33,112 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 56 [2020-10-24 02:38:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:33,113 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-10-24 02:38:33,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 02:38:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-10-24 02:38:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 02:38:33,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:33,117 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:33,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:38:33,117 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:33,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1374782841, now seen corresponding path program 7 times [2020-10-24 02:38:33,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:33,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570683841] [2020-10-24 02:38:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:33,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:33,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [570683841] [2020-10-24 02:38:33,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:33,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 02:38:33,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318622816] [2020-10-24 02:38:33,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 02:38:33,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 02:38:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-10-24 02:38:33,561 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 18 states. [2020-10-24 02:38:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:35,512 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2020-10-24 02:38:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 02:38:35,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2020-10-24 02:38:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:35,514 INFO L225 Difference]: With dead ends: 155 [2020-10-24 02:38:35,514 INFO L226 Difference]: Without dead ends: 98 [2020-10-24 02:38:35,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=1363, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 02:38:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-24 02:38:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2020-10-24 02:38:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 02:38:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-10-24 02:38:35,537 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 60 [2020-10-24 02:38:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:35,537 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-10-24 02:38:35,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 02:38:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-10-24 02:38:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-24 02:38:35,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:35,538 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:35,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:38:35,539 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash -621679588, now seen corresponding path program 8 times [2020-10-24 02:38:35,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:35,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954654337] [2020-10-24 02:38:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:35,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:35,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954654337] [2020-10-24 02:38:35,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:35,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 02:38:35,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637844789] [2020-10-24 02:38:35,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 02:38:35,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:35,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 02:38:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:38:35,997 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 20 states. [2020-10-24 02:38:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:38,316 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2020-10-24 02:38:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 02:38:38,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2020-10-24 02:38:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:38,318 INFO L225 Difference]: With dead ends: 163 [2020-10-24 02:38:38,318 INFO L226 Difference]: Without dead ends: 102 [2020-10-24 02:38:38,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 02:38:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-24 02:38:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2020-10-24 02:38:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 02:38:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2020-10-24 02:38:38,337 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 64 [2020-10-24 02:38:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:38,337 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2020-10-24 02:38:38,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 02:38:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2020-10-24 02:38:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 02:38:38,338 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:38,338 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:38,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:38:38,338 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1974974145, now seen corresponding path program 9 times [2020-10-24 02:38:38,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:38,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1750793841] [2020-10-24 02:38:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:38,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:38,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1750793841] [2020-10-24 02:38:38,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:38,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 02:38:38,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062568533] [2020-10-24 02:38:38,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 02:38:38,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 02:38:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:38:38,848 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 22 states. [2020-10-24 02:38:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:41,294 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2020-10-24 02:38:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-24 02:38:41,294 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2020-10-24 02:38:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:41,296 INFO L225 Difference]: With dead ends: 171 [2020-10-24 02:38:41,296 INFO L226 Difference]: Without dead ends: 106 [2020-10-24 02:38:41,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=251, Invalid=2199, Unknown=0, NotChecked=0, Total=2450 [2020-10-24 02:38:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-24 02:38:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2020-10-24 02:38:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 02:38:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2020-10-24 02:38:41,313 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 68 [2020-10-24 02:38:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:41,313 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2020-10-24 02:38:41,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 02:38:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2020-10-24 02:38:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 02:38:41,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:41,314 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:41,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:38:41,314 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1089119006, now seen corresponding path program 10 times [2020-10-24 02:38:41,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:41,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774643823] [2020-10-24 02:38:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:41,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:41,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774643823] [2020-10-24 02:38:41,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:41,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 02:38:41,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467042591] [2020-10-24 02:38:41,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 02:38:41,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:41,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 02:38:41,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2020-10-24 02:38:41,945 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 26 states. [2020-10-24 02:38:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:45,387 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2020-10-24 02:38:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-24 02:38:45,387 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2020-10-24 02:38:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:45,388 INFO L225 Difference]: With dead ends: 170 [2020-10-24 02:38:45,388 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:38:45,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=223, Invalid=3199, Unknown=0, NotChecked=0, Total=3422 [2020-10-24 02:38:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:38:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:38:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:38:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:38:45,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2020-10-24 02:38:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:45,392 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:38:45,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 02:38:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:38:45,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:38:45,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:38:45,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:38:47,034 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 18 [2020-10-24 02:38:47,420 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-10-24 02:38:47,791 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-10-24 02:38:48,066 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2020-10-24 02:38:48,869 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,870 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,870 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,870 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,870 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,870 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,871 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:38:48,871 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,871 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 02:38:48,871 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,872 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 02:38:48,872 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,872 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 02:38:48,872 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:38:48,872 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:38:48,873 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:38:48,873 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:38:48,873 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:38:48,873 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2020-10-24 02:38:48,873 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,873 INFO L270 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (or (and (<= 3 main_~v~0) (<= main_~v~0 3)) (= main_~v~0 0) (and (<= main_~v~0 9) (<= 9 main_~v~0)) (and (<= main_~v~0 7) (<= 7 main_~v~0)) (and (<= main_~v~0 8) (<= 8 main_~v~0)) (and (<= 2 main_~v~0) (<= main_~v~0 2)) (and (<= main_~v~0 1) (<= 1 main_~v~0)) (and (<= 4 main_~v~0) (<= main_~v~0 4)) (and (<= main_~v~0 5) (<= 5 main_~v~0)) (and (<= 6 main_~v~0) (<= main_~v~0 6))) [2020-10-24 02:38:48,874 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= main_~v~0 0) [2020-10-24 02:38:48,874 INFO L270 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (or (and (<= main_~v~0 7) (<= |main_#t~post11| 7) (<= 7 |main_#t~post11|) (<= 7 main_~v~0)) (and (<= main_~v~0 8) (<= 8 main_~v~0) (<= 8 |main_#t~post11|) (<= |main_#t~post11| 8)) (and (<= main_~v~0 5) (<= 5 |main_#t~post11|) (<= 5 main_~v~0) (<= |main_#t~post11| 5)) (and (= main_~v~0 0) (= 0 |main_#t~post11|)) (and (<= 2 |main_#t~post11|) (<= |main_#t~post11| 2) (<= 2 main_~v~0) (<= main_~v~0 2)) (and (<= 4 |main_#t~post11|) (<= |main_#t~post11| 4) (<= 4 main_~v~0) (<= main_~v~0 4)) (and (<= 9 |main_#t~post11|) (<= main_~v~0 9) (<= |main_#t~post11| 9) (<= 9 main_~v~0)) (and (<= |main_#t~post11| 1) (<= main_~v~0 1) (<= 1 main_~v~0) (<= 1 |main_#t~post11|)) (and (<= 6 main_~v~0) (<= 6 |main_#t~post11|) (<= |main_#t~post11| 6) (<= main_~v~0 6)) (and (<= 3 main_~v~0) (<= 3 |main_#t~post11|) (<= |main_#t~post11| 3) (<= main_~v~0 3))) [2020-10-24 02:38:48,874 INFO L270 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (or (and (<= 8 |main_#t~post11|) (<= main_~v~0 9) (<= |main_#t~post11| 8) (<= 9 main_~v~0)) (and (<= 6 main_~v~0) (<= 5 |main_#t~post11|) (<= |main_#t~post11| 5) (<= main_~v~0 6)) (and (<= 4 |main_#t~post11|) (<= main_~v~0 5) (<= |main_#t~post11| 4) (<= 5 main_~v~0)) (and (<= 2 |main_#t~post11|) (<= |main_#t~post11| 2) (<= 3 main_~v~0) (<= main_~v~0 3)) (and (<= main_~v~0 7) (<= 6 |main_#t~post11|) (<= |main_#t~post11| 6) (<= 7 main_~v~0)) (and (<= main_~v~0 1) (= 0 |main_#t~post11|) (<= 1 main_~v~0)) (and (<= |main_#t~post11| 1) (<= 2 main_~v~0) (<= main_~v~0 2) (<= 1 |main_#t~post11|)) (and (<= 9 |main_#t~post11|) (<= 10 main_~v~0) (<= (div main_~v~0 4) 2) (<= |main_#t~post11| 9)) (and (<= 3 |main_#t~post11|) (<= 4 main_~v~0) (<= |main_#t~post11| 3) (<= main_~v~0 4)) (and (<= main_~v~0 8) (<= 8 main_~v~0) (<= |main_#t~post11| 7) (<= 7 |main_#t~post11|))) [2020-10-24 02:38:48,875 INFO L270 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (or (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2)) (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= main_~v~0 9))) [2020-10-24 02:38:48,875 INFO L270 CegarLoopResult]: At program point L23-7(line 23) the Hoare annotation is: (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2)) [2020-10-24 02:38:48,875 INFO L270 CegarLoopResult]: At program point L19-3(lines 19 25) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,875 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-24 02:38:48,875 INFO L270 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,875 INFO L270 CegarLoopResult]: At program point L19-5(line 19) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,876 INFO L270 CegarLoopResult]: At program point L19-6(lines 19 25) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,876 INFO L277 CegarLoopResult]: At program point L19-7(lines 19 25) the Hoare annotation is: true [2020-10-24 02:38:48,876 INFO L270 CegarLoopResult]: At program point L24(lines 22 25) the Hoare annotation is: (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2)) [2020-10-24 02:38:48,876 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,876 INFO L270 CegarLoopResult]: At program point L20-3(lines 20 25) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,876 INFO L277 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-10-24 02:38:48,876 INFO L270 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,877 INFO L270 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,877 INFO L270 CegarLoopResult]: At program point L20-6(lines 20 25) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,877 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,877 INFO L270 CegarLoopResult]: At program point L21-3(lines 21 25) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,877 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 02:38:48,877 INFO L270 CegarLoopResult]: At program point L21-4(line 21) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,877 INFO L270 CegarLoopResult]: At program point L21-5(line 21) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,878 INFO L270 CegarLoopResult]: At program point L21-6(lines 21 25) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,878 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2020-10-24 02:38:48,878 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2020-10-24 02:38:48,878 INFO L270 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,878 INFO L270 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2)) [2020-10-24 02:38:48,878 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-24 02:38:48,878 INFO L270 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2)) [2020-10-24 02:38:48,879 INFO L270 CegarLoopResult]: At program point L22-5(lines 22 25) the Hoare annotation is: (or (= main_~v~0 0) (and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))) [2020-10-24 02:38:48,879 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2020-10-24 02:38:48,879 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (<= (+ __VERIFIER_assert_~cond 2) 0) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) (<= 2 __VERIFIER_assert_~cond)) [2020-10-24 02:38:48,879 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) [2020-10-24 02:38:48,879 INFO L270 CegarLoopResult]: At program point L6(lines 6 8) the Hoare annotation is: (or (<= (+ __VERIFIER_assert_~cond 2) 0) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) (<= 2 __VERIFIER_assert_~cond)) [2020-10-24 02:38:48,879 INFO L270 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) [2020-10-24 02:38:48,880 INFO L270 CegarLoopResult]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (<= (+ __VERIFIER_assert_~cond 2) 0) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ |__VERIFIER_assert_#in~cond| 2) 0))) (<= 2 __VERIFIER_assert_~cond)) [2020-10-24 02:38:48,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:38:48 BoogieIcfgContainer [2020-10-24 02:38:48,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:38:48,905 INFO L168 Benchmark]: Toolchain (without parser) took 26465.02 ms. Allocated memory was 155.2 MB in the beginning and 274.7 MB in the end (delta: 119.5 MB). Free memory was 131.1 MB in the beginning and 231.2 MB in the end (delta: -100.1 MB). Peak memory consumption was 158.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:38:48,906 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory is still 129.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:38:48,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.19 ms. Allocated memory is still 155.2 MB. Free memory was 130.7 MB in the beginning and 121.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 02:38:48,908 INFO L168 Benchmark]: Boogie Preprocessor took 42.40 ms. Allocated memory is still 155.2 MB. Free memory was 121.2 MB in the beginning and 119.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 02:38:48,908 INFO L168 Benchmark]: RCFGBuilder took 671.54 ms. Allocated memory is still 155.2 MB. Free memory was 119.9 MB in the beginning and 103.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-10-24 02:38:48,909 INFO L168 Benchmark]: TraceAbstraction took 25474.45 ms. Allocated memory was 155.2 MB in the beginning and 274.7 MB in the end (delta: 119.5 MB). Free memory was 102.8 MB in the beginning and 231.2 MB in the end (delta: -128.4 MB). Peak memory consumption was 130.3 MB. Max. memory is 8.0 GB. [2020-10-24 02:38:48,913 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory is still 129.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 263.19 ms. Allocated memory is still 155.2 MB. Free memory was 130.7 MB in the beginning and 121.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.40 ms. Allocated memory is still 155.2 MB. Free memory was 121.2 MB in the beginning and 119.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 671.54 ms. Allocated memory is still 155.2 MB. Free memory was 119.9 MB in the beginning and 103.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25474.45 ms. Allocated memory was 155.2 MB in the beginning and 274.7 MB in the end (delta: 119.5 MB). Free memory was 102.8 MB in the beginning and 231.2 MB in the end (delta: -128.4 MB). Peak memory consumption was 130.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 23]: Loop Invariant Derived loop invariant: (10 <= v && v / 4 <= 2) || (0 < v / 4294967296 + 1 && v <= 9) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: v == 0 || (10 <= v && v / 4 <= 2) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: v == 0 || (10 <= v && v / 4 <= 2) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: v == 0 || (10 <= v && v / 4 <= 2) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: v == 0 || (10 <= v && v / 4 <= 2) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (cond + 2 <= 0 || (!(2 <= \old(cond)) && !(\old(cond) + 2 <= 0))) || 2 <= cond - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.8s, OverallIterations: 12, TraceHistogramMax: 10, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 668 SDtfs, 1268 SDslu, 1721 SDs, 0 SdLazy, 7898 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 190 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 58 LocationsWithAnnotation, 174 PreInvPairs, 260 NumberOfFragments, 742 HoareAnnotationTreeSize, 174 FomulaSimplifications, 2578546 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 58 FomulaSimplificationsInter, 3015 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 604 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 129514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/715 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...