/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/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:49:13,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:49:13,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:49:13,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:49:13,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:49:13,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:49:13,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:49:13,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:49:13,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:49:13,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:49:13,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:49:13,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:49:13,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:49:13,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:49:13,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:49:13,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:49:13,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:49:13,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:49:13,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:49:13,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:49:13,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:49:13,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:49:13,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:49:13,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:49:13,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:49:13,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:49:13,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:49:13,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:49:13,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:49:13,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:49:13,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:49:13,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:49:13,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:49:13,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:49:13,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:49:13,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:49:13,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:49:13,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:49:13,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:49:13,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:49:13,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:49:13,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:49:13,730 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:49:13,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:49:13,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:49:13,733 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:49:13,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:49:13,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:49:13,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:49:13,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:49:13,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:49:13,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:49:13,734 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:49:13,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:49:13,735 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:49:13,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:49:13,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:49:13,735 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:49:13,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:49:13,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:49:13,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:49:13,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:49:13,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:49:13,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:49:13,737 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-11-07 06:49:14,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:49:14,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:49:14,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:49:14,292 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:49:14,292 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:49:14,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2020-11-07 06:49:14,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b67a954e/1f1a0f530d164b8b8646355be382afd8/FLAGb77342578 [2020-11-07 06:49:15,072 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:49:15,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2020-11-07 06:49:15,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b67a954e/1f1a0f530d164b8b8646355be382afd8/FLAGb77342578 [2020-11-07 06:49:15,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b67a954e/1f1a0f530d164b8b8646355be382afd8 [2020-11-07 06:49:15,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:49:15,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:49:15,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:15,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:49:15,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:49:15,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b17d895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15, skipping insertion in model container [2020-11-07 06:49:15,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:49:15,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:49:15,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:15,683 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:49:15,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:15,726 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:49:15,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15 WrapperNode [2020-11-07 06:49:15,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:15,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:49:15,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:49:15,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:49:15,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (1/1) ... [2020-11-07 06:49:15,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:49:15,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:49:15,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:49:15,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:49:15,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (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-11-07 06:49:15,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:49:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:49:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:49:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:49:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:49:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:49:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:49:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:49:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:49:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:49:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:49:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:49:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 06:49:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:49:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:49:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:49:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:49:16,503 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:49:16,503 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:49:16,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:16 BoogieIcfgContainer [2020-11-07 06:49:16,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:49:16,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:49:16,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:49:16,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:49:16,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:15" (1/3) ... [2020-11-07 06:49:16,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9abd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:16, skipping insertion in model container [2020-11-07 06:49:16,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:15" (2/3) ... [2020-11-07 06:49:16,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9abd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:16, skipping insertion in model container [2020-11-07 06:49:16,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:16" (3/3) ... [2020-11-07 06:49:16,547 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.c [2020-11-07 06:49:16,571 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:49:16,577 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:49:16,594 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:49:16,637 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:49:16,637 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:49:16,637 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:49:16,638 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:49:16,638 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:49:16,638 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:49:16,638 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:49:16,638 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:49:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-11-07 06:49:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 06:49:16,679 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:16,680 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] [2020-11-07 06:49:16,681 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:16,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2124698403, now seen corresponding path program 1 times [2020-11-07 06:49:16,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:16,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1362883335] [2020-11-07 06:49:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:17,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:17,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1362883335] [2020-11-07 06:49:17,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:49:17,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 06:49:17,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251347535] [2020-11-07 06:49:17,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 06:49:17,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 06:49:17,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:49:17,138 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-11-07 06:49:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:17,259 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-11-07 06:49:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 06:49:17,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-07 06:49:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:17,271 INFO L225 Difference]: With dead ends: 61 [2020-11-07 06:49:17,271 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 06:49:17,275 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-11-07 06:49:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 06:49:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 06:49:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 06:49:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-11-07 06:49:17,335 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 28 [2020-11-07 06:49:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:17,336 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-11-07 06:49:17,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 06:49:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-11-07 06:49:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 06:49:17,338 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:17,338 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] [2020-11-07 06:49:17,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:49:17,339 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1454540118, now seen corresponding path program 1 times [2020-11-07 06:49:17,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:17,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [893762601] [2020-11-07 06:49:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:17,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:17,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [893762601] [2020-11-07 06:49:17,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:49:17,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:49:17,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856050130] [2020-11-07 06:49:17,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:49:17,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:49:17,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:49:17,733 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2020-11-07 06:49:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:18,360 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2020-11-07 06:49:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:49:18,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-11-07 06:49:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:18,364 INFO L225 Difference]: With dead ends: 89 [2020-11-07 06:49:18,364 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 06:49:18,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:49:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 06:49:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2020-11-07 06:49:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 06:49:18,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-11-07 06:49:18,384 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 28 [2020-11-07 06:49:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:18,385 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-11-07 06:49:18,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:49:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-11-07 06:49:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-07 06:49:18,386 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:18,387 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-11-07 06:49:18,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:49:18,387 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1716557418, now seen corresponding path program 1 times [2020-11-07 06:49:18,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:18,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218202946] [2020-11-07 06:49:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:18,774 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2020-11-07 06:49:18,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:18,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218202946] [2020-11-07 06:49:18,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:19,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:49:19,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519891755] [2020-11-07 06:49:19,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:49:19,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:49:19,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:49:19,007 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 14 states. [2020-11-07 06:49:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:21,881 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-11-07 06:49:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:49:21,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-11-07 06:49:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:21,884 INFO L225 Difference]: With dead ends: 55 [2020-11-07 06:49:21,884 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 06:49:21,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2020-11-07 06:49:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 06:49:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-11-07 06:49:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 06:49:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-11-07 06:49:21,901 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2020-11-07 06:49:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:21,901 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-11-07 06:49:21,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:49:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-11-07 06:49:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 06:49:21,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:21,903 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] [2020-11-07 06:49:21,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:49:21,904 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1738014078, now seen corresponding path program 2 times [2020-11-07 06:49:21,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:21,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [62320244] [2020-11-07 06:49:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:22,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:22,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [62320244] [2020-11-07 06:49:22,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:22,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:22,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789344003] [2020-11-07 06:49:22,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:22,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:22,024 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2020-11-07 06:49:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:22,343 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2020-11-07 06:49:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:22,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-11-07 06:49:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:22,346 INFO L225 Difference]: With dead ends: 64 [2020-11-07 06:49:22,346 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 06:49:22,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 06:49:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-11-07 06:49:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-07 06:49:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-11-07 06:49:22,370 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 36 [2020-11-07 06:49:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:22,370 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-11-07 06:49:22,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-11-07 06:49:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-07 06:49:22,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:22,372 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-11-07 06:49:22,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:49:22,373 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1007706177, now seen corresponding path program 1 times [2020-11-07 06:49:22,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:22,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679349677] [2020-11-07 06:49:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:22,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:22,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679349677] [2020-11-07 06:49:22,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:22,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:22,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135091596] [2020-11-07 06:49:22,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:22,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:22,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:22,827 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2020-11-07 06:49:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:27,758 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-11-07 06:49:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:27,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-11-07 06:49:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:27,762 INFO L225 Difference]: With dead ends: 64 [2020-11-07 06:49:27,762 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 06:49:27,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:49:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 06:49:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2020-11-07 06:49:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 06:49:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-11-07 06:49:27,790 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2020-11-07 06:49:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:27,790 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-11-07 06:49:27,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-11-07 06:49:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-07 06:49:27,792 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:27,792 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1] [2020-11-07 06:49:27,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:49:27,793 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1709925144, now seen corresponding path program 1 times [2020-11-07 06:49:27,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:27,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [848144103] [2020-11-07 06:49:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:27,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:27,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [848144103] [2020-11-07 06:49:27,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:27,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:27,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030660707] [2020-11-07 06:49:27,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:27,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:27,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:27,932 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 5 states. [2020-11-07 06:49:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:28,174 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-11-07 06:49:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:28,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-11-07 06:49:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:28,176 INFO L225 Difference]: With dead ends: 62 [2020-11-07 06:49:28,176 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 06:49:28,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 06:49:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-11-07 06:49:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-07 06:49:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-11-07 06:49:28,195 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 38 [2020-11-07 06:49:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:28,195 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-11-07 06:49:28,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-11-07 06:49:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-07 06:49:28,197 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:28,197 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1] [2020-11-07 06:49:28,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:49:28,197 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1515992760, now seen corresponding path program 1 times [2020-11-07 06:49:28,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:28,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [493755819] [2020-11-07 06:49:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:28,635 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2020-11-07 06:49:28,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:28,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [493755819] [2020-11-07 06:49:28,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:28,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:49:28,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382127751] [2020-11-07 06:49:28,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:49:28,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:28,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:49:28,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:49:28,853 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 16 states. [2020-11-07 06:49:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:32,049 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-11-07 06:49:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:49:32,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2020-11-07 06:49:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:32,055 INFO L225 Difference]: With dead ends: 70 [2020-11-07 06:49:32,055 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 06:49:32,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:49:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 06:49:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2020-11-07 06:49:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-07 06:49:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-11-07 06:49:32,078 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 38 [2020-11-07 06:49:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:32,078 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-11-07 06:49:32,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:49:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-11-07 06:49:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 06:49:32,079 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:32,080 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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-11-07 06:49:32,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:49:32,080 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash 824100556, now seen corresponding path program 2 times [2020-11-07 06:49:32,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:32,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [144722708] [2020-11-07 06:49:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:32,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:32,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [144722708] [2020-11-07 06:49:32,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:32,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:49:32,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963798754] [2020-11-07 06:49:32,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:49:32,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:49:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:49:32,199 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2020-11-07 06:49:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:32,525 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2020-11-07 06:49:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:49:32,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-11-07 06:49:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:32,528 INFO L225 Difference]: With dead ends: 70 [2020-11-07 06:49:32,528 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 06:49:32,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 06:49:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2020-11-07 06:49:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 06:49:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2020-11-07 06:49:32,550 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 42 [2020-11-07 06:49:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:32,550 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2020-11-07 06:49:32,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:49:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-11-07 06:49:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 06:49:32,551 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:32,552 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2020-11-07 06:49:32,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:49:32,552 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:32,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1553809229, now seen corresponding path program 1 times [2020-11-07 06:49:32,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:32,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039916635] [2020-11-07 06:49:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:33,051 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-11-07 06:49:33,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:33,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039916635] [2020-11-07 06:49:33,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:33,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:49:33,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189562102] [2020-11-07 06:49:33,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:49:33,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:33,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:49:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:49:33,122 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 8 states. [2020-11-07 06:49:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:33,716 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-11-07 06:49:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:33,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 06:49:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:33,719 INFO L225 Difference]: With dead ends: 68 [2020-11-07 06:49:33,720 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 06:49:33,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 06:49:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 06:49:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 06:49:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-11-07 06:49:33,757 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 43 [2020-11-07 06:49:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:33,760 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-11-07 06:49:33,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:49:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-11-07 06:49:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 06:49:33,770 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:33,772 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2020-11-07 06:49:33,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:49:33,772 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -387641114, now seen corresponding path program 1 times [2020-11-07 06:49:33,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:33,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678433459] [2020-11-07 06:49:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:34,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:34,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678433459] [2020-11-07 06:49:34,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:34,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:49:34,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156658862] [2020-11-07 06:49:34,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:49:34,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:49:34,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:49:34,329 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 16 states. [2020-11-07 06:49:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:39,663 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-11-07 06:49:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:49:39,664 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2020-11-07 06:49:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:39,665 INFO L225 Difference]: With dead ends: 71 [2020-11-07 06:49:39,665 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 06:49:39,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2020-11-07 06:49:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 06:49:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2020-11-07 06:49:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 06:49:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-11-07 06:49:39,687 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 44 [2020-11-07 06:49:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:39,688 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-11-07 06:49:39,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:49:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-11-07 06:49:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-07 06:49:39,689 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:39,689 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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-11-07 06:49:39,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:49:39,689 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1043519994, now seen corresponding path program 2 times [2020-11-07 06:49:39,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:39,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [793212335] [2020-11-07 06:49:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:39,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:39,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [793212335] [2020-11-07 06:49:39,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:39,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:49:39,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100581758] [2020-11-07 06:49:39,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:49:39,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:39,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:49:39,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:39,834 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2020-11-07 06:49:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:40,247 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-11-07 06:49:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:49:40,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-11-07 06:49:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:40,249 INFO L225 Difference]: With dead ends: 73 [2020-11-07 06:49:40,249 INFO L226 Difference]: Without dead ends: 58 [2020-11-07 06:49:40,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:49:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-07 06:49:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-11-07 06:49:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 06:49:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-11-07 06:49:40,271 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 48 [2020-11-07 06:49:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:40,271 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-11-07 06:49:40,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:49:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-11-07 06:49:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:49:40,273 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:40,273 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1] [2020-11-07 06:49:40,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:49:40,273 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 953226053, now seen corresponding path program 1 times [2020-11-07 06:49:40,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:40,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531431963] [2020-11-07 06:49:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:41,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:41,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531431963] [2020-11-07 06:49:41,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:41,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 06:49:41,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781627647] [2020-11-07 06:49:41,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 06:49:41,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:41,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 06:49:41,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:49:41,129 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 20 states. [2020-11-07 06:49:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:42,668 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-11-07 06:49:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:49:42,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2020-11-07 06:49:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:42,669 INFO L225 Difference]: With dead ends: 72 [2020-11-07 06:49:42,670 INFO L226 Difference]: Without dead ends: 66 [2020-11-07 06:49:42,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 06:49:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-07 06:49:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2020-11-07 06:49:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 06:49:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-11-07 06:49:42,713 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 49 [2020-11-07 06:49:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:42,713 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-11-07 06:49:42,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 06:49:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-11-07 06:49:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 06:49:42,714 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:42,714 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 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, 1, 1] [2020-11-07 06:49:42,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:49:42,715 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:42,718 INFO L82 PathProgramCache]: Analyzing trace with hash -645360423, now seen corresponding path program 2 times [2020-11-07 06:49:42,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:42,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [736004119] [2020-11-07 06:49:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:43,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [736004119] [2020-11-07 06:49:43,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:43,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 06:49:43,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715967822] [2020-11-07 06:49:43,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 06:49:43,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:43,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 06:49:43,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:49:43,661 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 22 states. [2020-11-07 06:49:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:51,789 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-11-07 06:49:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:49:51,790 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2020-11-07 06:49:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:51,791 INFO L225 Difference]: With dead ends: 74 [2020-11-07 06:49:51,791 INFO L226 Difference]: Without dead ends: 68 [2020-11-07 06:49:51,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 06:49:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-07 06:49:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2020-11-07 06:49:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 06:49:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-11-07 06:49:51,829 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 53 [2020-11-07 06:49:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:51,831 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-11-07 06:49:51,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 06:49:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-11-07 06:49:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 06:49:51,832 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:51,833 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1] [2020-11-07 06:49:51,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:49:51,833 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 137540678, now seen corresponding path program 3 times [2020-11-07 06:49:51,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:51,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897130433] [2020-11-07 06:49:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:52,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:52,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1897130433] [2020-11-07 06:49:52,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:52,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:49:52,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459688328] [2020-11-07 06:49:52,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:49:52,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:49:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:49:52,048 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 8 states. [2020-11-07 06:49:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:52,558 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2020-11-07 06:49:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:52,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-11-07 06:49:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:52,561 INFO L225 Difference]: With dead ends: 78 [2020-11-07 06:49:52,561 INFO L226 Difference]: Without dead ends: 63 [2020-11-07 06:49:52,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-07 06:49:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-07 06:49:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 06:49:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2020-11-07 06:49:52,597 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 54 [2020-11-07 06:49:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:52,598 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2020-11-07 06:49:52,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:49:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-11-07 06:49:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 06:49:52,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:52,599 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 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, 1, 1] [2020-11-07 06:49:52,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:49:52,599 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1757228141, now seen corresponding path program 4 times [2020-11-07 06:49:52,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:52,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152559967] [2020-11-07 06:49:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:52,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:52,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152559967] [2020-11-07 06:49:52,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:52,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:52,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350629249] [2020-11-07 06:49:52,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:52,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:52,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:52,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:52,822 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 9 states. [2020-11-07 06:49:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:53,447 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2020-11-07 06:49:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:53,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2020-11-07 06:49:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:53,448 INFO L225 Difference]: With dead ends: 85 [2020-11-07 06:49:53,448 INFO L226 Difference]: Without dead ends: 70 [2020-11-07 06:49:53,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:49:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-07 06:49:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2020-11-07 06:49:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 06:49:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2020-11-07 06:49:53,469 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 57 [2020-11-07 06:49:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:53,469 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2020-11-07 06:49:53,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-11-07 06:49:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 06:49:53,470 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:53,470 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:49:53,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:49:53,470 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1603342130, now seen corresponding path program 5 times [2020-11-07 06:49:53,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:53,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [953055391] [2020-11-07 06:49:53,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:53,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:53,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [953055391] [2020-11-07 06:49:53,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:53,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:49:53,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462337888] [2020-11-07 06:49:53,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:49:53,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:49:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:49:53,909 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 10 states. [2020-11-07 06:49:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:57,449 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-11-07 06:49:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:49:57,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-11-07 06:49:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:57,451 INFO L225 Difference]: With dead ends: 85 [2020-11-07 06:49:57,451 INFO L226 Difference]: Without dead ends: 70 [2020-11-07 06:49:57,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:49:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-07 06:49:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-11-07 06:49:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 06:49:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-11-07 06:49:57,479 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 58 [2020-11-07 06:49:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:57,479 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-11-07 06:49:57,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:49:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-11-07 06:49:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 06:49:57,480 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:57,480 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 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-11-07 06:49:57,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:49:57,481 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:57,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:57,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1300196793, now seen corresponding path program 6 times [2020-11-07 06:49:57,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:57,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801701480] [2020-11-07 06:49:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:57,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:57,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801701480] [2020-11-07 06:49:57,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:57,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:57,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189506667] [2020-11-07 06:49:57,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:57,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:57,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:57,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:57,676 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 9 states. [2020-11-07 06:49:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:58,261 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-11-07 06:49:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:58,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2020-11-07 06:49:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:58,263 INFO L225 Difference]: With dead ends: 83 [2020-11-07 06:49:58,263 INFO L226 Difference]: Without dead ends: 68 [2020-11-07 06:49:58,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:49:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-07 06:49:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-11-07 06:49:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 06:49:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-11-07 06:49:58,288 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 59 [2020-11-07 06:49:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:58,288 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-11-07 06:49:58,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-11-07 06:49:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 06:49:58,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:58,289 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 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-11-07 06:49:58,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:49:58,290 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1494129177, now seen corresponding path program 7 times [2020-11-07 06:49:58,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:58,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863536468] [2020-11-07 06:49:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:59,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863536468] [2020-11-07 06:49:59,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:59,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 06:49:59,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752774622] [2020-11-07 06:49:59,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 06:49:59,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 06:49:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2020-11-07 06:49:59,400 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 24 states. [2020-11-07 06:50:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:01,453 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2020-11-07 06:50:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:50:01,453 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2020-11-07 06:50:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:01,454 INFO L225 Difference]: With dead ends: 82 [2020-11-07 06:50:01,454 INFO L226 Difference]: Without dead ends: 76 [2020-11-07 06:50:01,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 06:50:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-07 06:50:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2020-11-07 06:50:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 06:50:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-11-07 06:50:01,492 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 59 [2020-11-07 06:50:01,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:01,492 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-11-07 06:50:01,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 06:50:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-11-07 06:50:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 06:50:01,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:01,493 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 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-11-07 06:50:01,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 06:50:01,493 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1004878213, now seen corresponding path program 8 times [2020-11-07 06:50:01,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:01,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974619178] [2020-11-07 06:50:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:01,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:01,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974619178] [2020-11-07 06:50:01,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:01,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:50:01,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472221557] [2020-11-07 06:50:01,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:50:01,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:50:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:50:01,704 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 10 states. [2020-11-07 06:50:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:02,474 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-11-07 06:50:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:50:02,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 06:50:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:02,476 INFO L225 Difference]: With dead ends: 91 [2020-11-07 06:50:02,477 INFO L226 Difference]: Without dead ends: 76 [2020-11-07 06:50:02,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:50:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-07 06:50:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2020-11-07 06:50:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-07 06:50:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-11-07 06:50:02,503 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 63 [2020-11-07 06:50:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:02,503 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-11-07 06:50:02,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:50:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-11-07 06:50:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 06:50:02,504 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:02,504 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:02,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 06:50:02,504 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1877391076, now seen corresponding path program 9 times [2020-11-07 06:50:02,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:02,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2040124604] [2020-11-07 06:50:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:03,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:03,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2040124604] [2020-11-07 06:50:03,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:03,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 06:50:03,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866135152] [2020-11-07 06:50:03,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 06:50:03,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:03,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 06:50:03,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:50:03,739 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 26 states. [2020-11-07 06:50:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:06,251 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2020-11-07 06:50:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 06:50:06,253 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2020-11-07 06:50:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:06,254 INFO L225 Difference]: With dead ends: 90 [2020-11-07 06:50:06,255 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 06:50:06,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=246, Invalid=2010, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 06:50:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 06:50:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2020-11-07 06:50:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 06:50:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-11-07 06:50:06,283 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 64 [2020-11-07 06:50:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:06,284 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-11-07 06:50:06,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 06:50:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-11-07 06:50:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 06:50:06,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:06,284 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 3, 3, 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] [2020-11-07 06:50:06,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 06:50:06,285 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:06,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:06,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2144686328, now seen corresponding path program 10 times [2020-11-07 06:50:06,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:06,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [907327257] [2020-11-07 06:50:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:06,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 17 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:06,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [907327257] [2020-11-07 06:50:06,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:06,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:50:06,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177041109] [2020-11-07 06:50:06,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:06,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:06,534 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 11 states. [2020-11-07 06:50:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:07,450 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2020-11-07 06:50:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:50:07,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-11-07 06:50:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:07,452 INFO L225 Difference]: With dead ends: 99 [2020-11-07 06:50:07,453 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 06:50:07,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:50:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 06:50:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-11-07 06:50:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 06:50:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-11-07 06:50:07,486 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 68 [2020-11-07 06:50:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:07,487 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-11-07 06:50:07,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-11-07 06:50:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 06:50:07,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:07,488 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 6, 4, 3, 3, 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] [2020-11-07 06:50:07,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 06:50:07,488 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:07,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1486001074, now seen corresponding path program 11 times [2020-11-07 06:50:07,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:07,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015612241] [2020-11-07 06:50:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:08,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:09,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015612241] [2020-11-07 06:50:09,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:09,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 06:50:09,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923887759] [2020-11-07 06:50:09,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 06:50:09,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 06:50:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:50:09,005 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 28 states. [2020-11-07 06:50:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:11,915 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2020-11-07 06:50:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:50:11,918 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 70 [2020-11-07 06:50:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:11,919 INFO L225 Difference]: With dead ends: 93 [2020-11-07 06:50:11,919 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 06:50:11,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=263, Invalid=2389, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 06:50:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 06:50:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2020-11-07 06:50:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 06:50:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2020-11-07 06:50:11,950 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 70 [2020-11-07 06:50:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:11,950 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2020-11-07 06:50:11,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 06:50:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-11-07 06:50:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 06:50:11,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:11,951 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:11,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 06:50:11,952 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1116346054, now seen corresponding path program 12 times [2020-11-07 06:50:11,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:11,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570779725] [2020-11-07 06:50:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:13,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570779725] [2020-11-07 06:50:13,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:13,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-11-07 06:50:13,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216738979] [2020-11-07 06:50:13,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 06:50:13,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 06:50:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:50:13,584 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 30 states. [2020-11-07 06:50:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:16,966 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-11-07 06:50:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 06:50:16,966 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 74 [2020-11-07 06:50:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:16,967 INFO L225 Difference]: With dead ends: 80 [2020-11-07 06:50:16,967 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:50:16,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=281, Invalid=2799, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 06:50:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:50:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:50:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:50:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:50:16,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-11-07 06:50:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:16,969 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:50:16,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 06:50:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:50:16,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:50:16,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 06:50:16,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:50:17,253 WARN L194 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 261 [2020-11-07 06:50:17,533 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 235 [2020-11-07 06:50:17,852 WARN L194 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 256 [2020-11-07 06:50:18,073 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 223 [2020-11-07 06:50:18,348 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 129 [2020-11-07 06:50:18,506 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 141 [2020-11-07 06:50:18,685 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 172 [2020-11-07 06:50:19,011 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 202 [2020-11-07 06:50:20,143 WARN L194 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 245 DAG size of output: 117 [2020-11-07 06:50:21,090 WARN L194 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 105 [2020-11-07 06:50:22,164 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 242 DAG size of output: 111 [2020-11-07 06:50:23,476 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 211 DAG size of output: 89 [2020-11-07 06:50:24,170 WARN L194 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 58 [2020-11-07 06:50:24,664 WARN L194 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 56 [2020-11-07 06:50:31,677 WARN L194 SmtUtils]: Spent 6.96 s on a formula simplification. DAG size of input: 162 DAG size of output: 76 [2020-11-07 06:50:31,805 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 25 [2020-11-07 06:50:35,548 WARN L194 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 219 DAG size of output: 117 [2020-11-07 06:50:36,422 WARN L194 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 66 [2020-11-07 06:50:36,438 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,439 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,439 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,439 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,439 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,439 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,439 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:50:36,440 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,440 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:50:36,440 INFO L269 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,440 INFO L262 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:50:36,440 INFO L262 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)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#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-11-07 06:50:36,440 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,440 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 06:50:36,441 INFO L262 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:50:36,441 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:50:36,441 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:50:36,441 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:50:36,441 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:50:36,441 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:50:36,441 INFO L266 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-11-07 06:50:36,441 INFO L266 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-11-07 06:50:36,441 INFO L266 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:50:36,442 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:50:36,442 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 06:50:36,442 INFO L262 CegarLoopResult]: At program point L27(lines 27 30) the Hoare annotation is: (let ((.cse9 (div main_~l~0 4294967296))) (let ((.cse10 (* .cse9 (- 4294967296)))) (let ((.cse7 (div (+ main_~l~0 .cse10) 3)) (.cse5 (* 4294967296 (div main_~n~0 4294967296))) (.cse4 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse3 (<= .cse4 main_~l~0)) (.cse2 (+ .cse5 main_~l~0 1)) (.cse6 (* 4294967296 .cse9)) (.cse0 (= main_~i~0 0)) (.cse1 (= main_~j~0 0)) (.cse8 (div (+ (* .cse7 (- 3)) main_~l~0 .cse10) 4294967296))) (or (and (<= 1 main_~l~0) (= main_~k~0 0) .cse0 .cse1 (<= main_~v4~0 main_~l~0) (<= .cse2 (+ main_~n~0 main_~v4~0)) (<= main_~l~0 main_~v4~0) (<= (div main_~l~0 2) 0)) (and .cse3 (<= main_~l~0 5) (<= 5 .cse4) (<= (+ .cse5 main_~l~0 6) (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse6))) (not (<= ~SIZE~0 20000001)) (and .cse3 (<= 7 .cse4) (<= (+ (* 6 .cse7) (* 8589934593 .cse8) (* 8589934592 .cse9) 2) (* 2 main_~l~0)) (<= .cse2 (+ main_~n~0 .cse6)) (<= .cse9 0) (<= main_~l~0 .cse4)) (not (<= 20000001 ~SIZE~0)) (and (<= (+ .cse5 main_~l~0) (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse0 .cse1 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= (+ .cse7 (* 1431655765 .cse8) (* 1431655765 .cse9)) 0) (<= 6442450942 (+ (* 3221225471 main_~l~0) (div main_~l~0 4))))))))) [2020-11-07 06:50:36,443 INFO L262 CegarLoopResult]: At program point L25(lines 25 30) the Hoare annotation is: (let ((.cse9 (div main_~l~0 4294967296))) (let ((.cse12 (* .cse9 (- 4294967296)))) (let ((.cse11 (* 4294967296 .cse9)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse7 (div (+ main_~l~0 .cse12) 3)) (.cse2 (* 4294967296 (div main_~n~0 4294967296)))) (let ((.cse5 (= main_~i~0 0)) (.cse6 (= main_~j~0 0)) (.cse4 (+ .cse2 main_~l~0)) (.cse8 (div (+ (* .cse7 (- 3)) main_~l~0 .cse12) 4294967296)) (.cse0 (<= .cse1 main_~l~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse11))) (or (and .cse0 (<= main_~l~0 5) (<= 5 .cse1) (<= (+ .cse2 main_~l~0 6) .cse3)) (and (<= .cse4 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse5 .cse6 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= (+ .cse7 (* 1431655765 .cse8) (* 1431655765 .cse9)) 0) (<= 2 main_~l~0)) (let ((.cse10 (+ main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse10 main_~l~0) .cse5 (<= (div main_~l~0 4) 0) (<= (+ .cse2 main_~l~0 4) (+ main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse11)) (<= 3 main_~l~0) (<= main_~l~0 .cse10))) (and .cse0 (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 .cse11)) (<= .cse9 0) (<= main_~l~0 .cse1) (<= 7 main_~l~0)) (not (<= ~SIZE~0 20000001)) (and (<= 1 main_~l~0) (= main_~k~0 0) .cse5 .cse6 (<= main_~v4~0 main_~l~0) (<= .cse4 (+ (* 4294967296 (div (+ main_~v4~0 (- 1)) 4294967296)) main_~n~0)) (<= (div main_~l~0 2) 0) (<= (+ (* 25769803776 .cse7) (* 36893488151714070528 .cse8) main_~n~0 (* 36893488151714070528 .cse9) 8569934592) (+ .cse2 (* 8589934593 main_~l~0)))) (not (<= 20000001 ~SIZE~0)) (and .cse0 (<= main_~l~0 6) (<= (+ .cse2 main_~l~0 7) .cse3) (<= 6 .cse1))))))) [2020-11-07 06:50:36,443 INFO L262 CegarLoopResult]: At program point L27-2(lines 23 30) the Hoare annotation is: (let ((.cse11 (div main_~l~0 4294967296))) (let ((.cse9 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse5 (+ main_~l~0 1)) (.cse2 (* 4294967296 (div main_~n~0 4294967296))) (.cse10 (* 4294967296 .cse11))) (let ((.cse8 (= main_~j~0 0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse10)) (.cse7 (= main_~i~0 0)) (.cse4 (+ .cse2 main_~l~0)) (.cse0 (<= .cse9 .cse5)) (.cse1 (<= .cse5 .cse9))) (or (and .cse0 .cse1 (<= main_~l~0 6) (<= (+ .cse2 main_~l~0 8) .cse3) (<= 6 main_~l~0)) (and .cse0 (<= main_~l~0 3) (<= .cse4 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 4)) 4294967296)) 2)) (<= (+ .cse2 main_~l~0 5) .cse3) (<= (+ (* 6442450944 (div (+ main_~l~0 (- 1)) 3)) main_~n~0 2147483652) (+ .cse2 (* 2147483649 main_~l~0)))) (and .cse0 (<= main_~l~0 4) (<= 4 main_~l~0) (<= .cse4 (+ (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 5)) 4294967296)) main_~n~0 3))) (let ((.cse6 (+ main_~k~0 main_~v4~0))) (and (<= .cse5 .cse6) (<= 1 main_~l~0) .cse7 .cse8 (<= (+ .cse2 main_~l~0 2) (+ main_~k~0 main_~n~0 main_~v4~0)) (<= .cse6 .cse5) (<= main_~l~0 1))) (and (<= (+ .cse2 2) (+ main_~v4~0 main_~n~0)) (<= 1 main_~v4~0) (= main_~k~0 0) .cse7 .cse8 (= main_~l~0 0) (<= main_~v4~0 1) (<= main_~n~0 (+ .cse2 20000001))) (not (<= ~SIZE~0 20000001)) (and .cse0 (<= main_~l~0 5) (<= (+ .cse2 main_~l~0 7) .cse3) (<= 6 .cse9)) (and .cse7 (<= main_~l~0 2) (<= 2 main_~l~0) (<= (+ main_~j~0 main_~k~0 main_~v4~0) .cse5) (<= .cse4 (+ (* 4294967296 (div (+ main_~j~0 main_~k~0 main_~v4~0 (- 3)) 4294967296)) main_~n~0 1))) (not (<= 20000001 ~SIZE~0)) (and .cse0 (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 .cse10)) .cse1 (<= 8 .cse9) (<= .cse11 0)))))) [2020-11-07 06:50:36,443 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 16 35) the Hoare annotation is: true [2020-11-07 06:50:36,444 INFO L262 CegarLoopResult]: At program point L23(lines 23 30) the Hoare annotation is: (let ((.cse7 (div main_~l~0 4294967296))) (let ((.cse3 (* 4294967296 .cse7)) (.cse5 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse2 (* 4294967296 (div main_~n~0 4294967296)))) (let ((.cse10 (= main_~k~0 0)) (.cse1 (= main_~i~0 0)) (.cse9 (= main_~j~0 0)) (.cse8 (+ .cse2 main_~l~0)) (.cse4 (<= .cse5 main_~l~0)) (.cse6 (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3))) (or (let ((.cse0 (+ main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) .cse1 (<= (div main_~l~0 4) 0) (<= (+ .cse2 main_~l~0 4) (+ main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3)) (<= 3 main_~l~0) (<= main_~l~0 .cse0))) (and .cse4 (<= main_~l~0 5) (<= 5 .cse5) (<= (+ .cse2 main_~l~0 6) .cse6)) (and .cse4 (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 .cse3)) (<= .cse7 0) (<= main_~l~0 .cse5) (<= 7 main_~l~0)) (and (<= .cse8 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse1 .cse9 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= main_~l~0 2) (<= 2 main_~l~0)) (and .cse10 .cse1 .cse9 (= main_~l~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ .cse2 20000001)) (<= (+ .cse2 1) main_~n~0)) (not (<= ~SIZE~0 20000001)) (and (<= 1 main_~l~0) .cse10 .cse1 .cse9 (<= main_~v4~0 main_~l~0) (<= .cse8 (+ (* 4294967296 (div (+ main_~v4~0 (- 1)) 4294967296)) main_~n~0)) (<= (div main_~l~0 2) 0) (<= (let ((.cse12 (* .cse7 (- 4294967296)))) (let ((.cse11 (div (+ main_~l~0 .cse12) 3))) (+ (* 25769803776 .cse11) (* 36893488151714070528 (div (+ (* .cse11 (- 3)) main_~l~0 .cse12) 4294967296)) main_~n~0 (* 36893488151714070528 .cse7) 8569934592))) (+ .cse2 (* 8589934593 main_~l~0)))) (and .cse4 (<= main_~l~0 4) (<= .cse8 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 4)) 4294967296)) 3)) (<= 4 main_~l~0)) (not (<= 20000001 ~SIZE~0)) (and .cse4 (<= main_~l~0 6) (<= (+ .cse2 main_~l~0 7) .cse6) (<= 6 .cse5)))))) [2020-11-07 06:50:36,444 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,445 INFO L262 CegarLoopResult]: At program point L21-2(lines 21 32) the Hoare annotation is: (let ((.cse14 (div main_~l~0 4294967296)) (.cse9 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse11 (+ (* 4294967296 (div .cse9 4294967296)) main_~l~0)) (.cse10 (* 4294967296 .cse14)) (.cse6 (* 4294967296 (div main_~n~0 4294967296))) (.cse8 (div main_~l~0 4))) (let ((.cse3 (<= .cse8 0)) (.cse5 (= main_~k~0 0)) (.cse1 (= main_~i~0 0)) (.cse2 (= main_~j~0 0)) (.cse7 (<= .cse9 main_~l~0)) (.cse0 (+ .cse6 main_~l~0)) (.cse4 (< .cse11 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse10 1)))) (or (and (<= .cse0 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse1 .cse2 .cse3 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= 2 main_~l~0) .cse4) (and .cse5 .cse1 .cse2 (= main_~l~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ .cse6 20000001))) (and .cse7 (<= .cse8 1) (<= 5 .cse9) .cse4) (and (<= .cse0 (+ (* 4294967296 (div (+ main_~j~0 main_~k~0 main_~v4~0 (- 3)) 4294967296)) main_~n~0 2)) (<= (+ main_~j~0 main_~k~0 main_~v4~0) main_~l~0) .cse1 .cse3 (<= 3 main_~l~0)) (and .cse7 (<= main_~l~0 4) (<= 4 .cse9) (<= .cse0 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 4)) 4294967296)) 3))) (not (<= ~SIZE~0 20000001)) (and (<= 1 main_~l~0) .cse5 .cse1 .cse2 (<= .cse0 (+ (* 4294967296 (div (+ main_~v4~0 (- 1)) 4294967296)) main_~n~0)) (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse10) .cse11) (<= (div main_~l~0 2) 0) (<= (let ((.cse13 (* .cse14 (- 4294967296)))) (let ((.cse12 (div (+ main_~l~0 .cse13) 3))) (+ (* 25769803776 .cse12) (* 36893488151714070528 (div (+ (* .cse12 (- 3)) main_~l~0 .cse13) 4294967296)) main_~n~0 (* 36893488151714070528 .cse14) 8569934592))) (+ .cse6 (* 8589934593 main_~l~0))) (<= main_~v4~0 (+ .cse10 4294967295))) (and .cse7 (<= 7 .cse9) (<= .cse0 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse14 0) .cse4) (not (<= 20000001 ~SIZE~0)))))) [2020-11-07 06:50:36,445 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,445 INFO L262 CegarLoopResult]: At program point L21-3(lines 21 32) the Hoare annotation is: (or (let ((.cse1 (+ (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0) 4294967296)) main_~l~0)) (.cse0 (* 4294967296 (div main_~l~0 4294967296)))) (and (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse0) .cse1) (< .cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse0 1)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,445 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 06:50:36,446 INFO L262 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (= main_~i~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,446 INFO L262 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,446 INFO L262 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,446 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 16 35) the Hoare annotation is: true [2020-11-07 06:50:36,446 INFO L262 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~n~0 4294967296))) (.cse7 (div main_~l~0 4294967296)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse0 (<= .cse1 main_~l~0)) (.cse3 (* 4294967296 .cse7)) (.cse4 (+ .cse2 main_~l~0 1))) (or (and .cse0 (<= main_~l~0 5) (<= 5 .cse1) (<= (+ .cse2 main_~l~0 6) (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3))) (and .cse0 (<= 7 .cse1) (<= .cse4 (+ main_~n~0 .cse3)) (<= (let ((.cse6 (* .cse7 (- 4294967296)))) (let ((.cse5 (div (+ main_~l~0 .cse6) 3))) (+ (* 6 .cse5) (* 8589934593 (div (+ (* .cse5 (- 3)) main_~l~0 .cse6) 4294967296)) (* 8589934592 .cse7) 2))) (* 2 main_~l~0)) (<= .cse7 0) (<= main_~l~0 .cse1)) (and (<= 1 main_~l~0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (<= main_~v4~0 main_~l~0) (<= main_~l~0 1) (<= .cse4 (+ main_~n~0 main_~v4~0)) (<= main_~l~0 main_~v4~0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))))) [2020-11-07 06:50:36,446 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 16 35) the Hoare annotation is: true [2020-11-07 06:50:36,447 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~n~0 4294967296)))) (let ((.cse0 (+ .cse1 main_~l~0))) (or (and (<= .cse0 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) (= main_~i~0 0) (= main_~j~0 0) (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= main_~l~0 2) (<= (+ (* 6442450944 (div main_~l~0 3)) main_~n~0 3) (+ .cse1 (* 2147483649 main_~l~0)))) (not (<= ~SIZE~0 20000001)) (let ((.cse3 (div main_~l~0 4294967296)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse2 main_~l~0) (<= 7 .cse2) (<= (+ .cse1 main_~l~0 1) (+ main_~n~0 (* 4294967296 .cse3))) (<= (let ((.cse5 (* .cse3 (- 4294967296)))) (let ((.cse4 (div (+ main_~l~0 .cse5) 3))) (+ (* 6 .cse4) (* 8589934593 (div (+ (* .cse4 (- 3)) main_~l~0 .cse5) 4294967296)) (* 8589934592 .cse3) 2))) (* 2 main_~l~0)) (<= .cse0 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse3 0) (<= main_~l~0 .cse2))) (not (<= 20000001 ~SIZE~0))))) [2020-11-07 06:50:36,447 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse4 (div main_~l~0 4294967296)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse0 (<= .cse1 main_~l~0)) (.cse2 (* 4294967296 (div main_~n~0 4294967296))) (.cse3 (* 4294967296 .cse4))) (or (and .cse0 (<= 7 .cse1) (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 .cse3)) (<= (+ .cse2 main_~l~0) (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse4 0) (<= main_~l~0 .cse1)) (not (<= ~SIZE~0 20000001)) (let ((.cse5 (+ main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse5 main_~l~0) (<= main_~l~0 3) (= main_~i~0 0) (<= (+ .cse2 main_~l~0 4) (+ main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3)) (<= 3 main_~l~0) (<= main_~l~0 .cse5))) (not (<= 20000001 ~SIZE~0)) (and .cse0 (<= main_~l~0 6) (<= (+ .cse2 main_~l~0 7) (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3)) (<= 6 .cse1))))) [2020-11-07 06:50:36,447 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~n~0 4294967296))) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse0 (<= .cse1 main_~l~0)) (.cse4 (+ .cse2 main_~l~0))) (or (let ((.cse3 (div main_~l~0 4294967296))) (and .cse0 (<= 7 .cse1) (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 (* 4294967296 .cse3))) (<= .cse4 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse3 0) (<= main_~l~0 .cse1))) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ .cse2 20000001)) (<= (+ .cse2 1) main_~n~0)) (and .cse0 (<= main_~l~0 4) (<= 4 .cse1) (<= .cse4 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 4)) 4294967296)) 3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))))) [2020-11-07 06:50:36,448 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,448 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 06:50:36,448 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:50:36,448 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-11-07 06:50:36,448 INFO L262 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:50:36,448 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2020-11-07 06:50:36,449 INFO L262 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:50:36,449 INFO L262 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:50:36,449 INFO L269 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2020-11-07 06:50:36,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:50:36 BoogieIcfgContainer [2020-11-07 06:50:36,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:50:36,484 INFO L168 Benchmark]: Toolchain (without parser) took 81070.13 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 128.1 MB in the beginning and 134.1 MB in the end (delta: -6.0 MB). Peak memory consumption was 105.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:36,484 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 125.8 MB. Free memory is still 101.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:50:36,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.90 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 117.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:36,485 INFO L168 Benchmark]: Boogie Preprocessor took 39.43 ms. Allocated memory is still 151.0 MB. Free memory was 117.7 MB in the beginning and 116.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:36,486 INFO L168 Benchmark]: RCFGBuilder took 742.22 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 134.3 MB in the end (delta: -18.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:36,486 INFO L168 Benchmark]: TraceAbstraction took 79965.20 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 133.9 MB in the beginning and 134.1 MB in the end (delta: -255.9 kB). Peak memory consumption was 109.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:36,490 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 125.8 MB. Free memory is still 101.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 305.90 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 117.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.43 ms. Allocated memory is still 151.0 MB. Free memory was 117.7 MB in the beginning and 116.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 742.22 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 134.3 MB in the end (delta: -18.1 MB). Peak memory consumption was 19.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 79965.20 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 133.9 MB in the beginning and 134.1 MB in the end (delta: -255.9 kB). Peak memory consumption was 109.8 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: 21]: Loop Invariant Derived loop invariant: (((((((((((((4294967296 * (n / 4294967296) + l <= 4294967296 * ((k + v4 + -2) / 4294967296) + n + 1 && i == 0) && j == 0) && l / 4 <= 0) && k + v4 <= l) && 2 <= l) && 4294967296 * ((i + j + k + v4) / 4294967296) + l < i + j + k + v4 + 4294967296 * (l / 4294967296) + 1) || (((((k == 0 && i == 0) && j == 0) && l == 0) && v4 == 0) && n <= 4294967296 * (n / 4294967296) + 20000001)) || (((i + j + k + v4 <= l && l / 4 <= 1) && 5 <= i + j + k + v4) && 4294967296 * ((i + j + k + v4) / 4294967296) + l < i + j + k + v4 + 4294967296 * (l / 4294967296) + 1)) || ((((4294967296 * (n / 4294967296) + l <= 4294967296 * ((j + k + v4 + -3) / 4294967296) + n + 2 && j + k + v4 <= l) && i == 0) && l / 4 <= 0) && 3 <= l)) || (((i + j + k + v4 <= l && l <= 4) && 4 <= i + j + k + v4) && 4294967296 * (n / 4294967296) + l <= n + 4294967296 * ((i + j + k + v4 + -4) / 4294967296) + 3)) || !(SIZE <= 20000001)) || ((((((((1 <= l && k == 0) && i == 0) && j == 0) && 4294967296 * (n / 4294967296) + l <= 4294967296 * ((v4 + -1) / 4294967296) + n) && i + j + k + v4 + 4294967296 * (l / 4294967296) <= 4294967296 * ((i + j + k + v4) / 4294967296) + l) && l / 2 <= 0) && 25769803776 * ((l + l / 4294967296 * -4294967296) / 3) + 36893488151714070528 * (((l + l / 4294967296 * -4294967296) / 3 * -3 + l + l / 4294967296 * -4294967296) / 4294967296) + n + 36893488151714070528 * (l / 4294967296) + 8569934592 <= 4294967296 * (n / 4294967296) + 8589934593 * l) && v4 <= 4294967296 * (l / 4294967296) + 4294967295)) || ((((i + j + k + v4 <= l && 7 <= i + j + k + v4) && 4294967296 * (n / 4294967296) + l <= n + 4294967296 * ((i + j + k + v4 + -8) / 4294967296)) && l / 4294967296 <= 0) && 4294967296 * ((i + j + k + v4) / 4294967296) + l < i + j + k + v4 + 4294967296 * (l / 4294967296) + 1)) || !(20000001 <= SIZE) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 60.3s, OverallIterations: 23, TraceHistogramMax: 9, AutomataDifference: 46.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 701 SDtfs, 2139 SDslu, 2127 SDs, 0 SdLazy, 7055 SolverSat, 492 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 143 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 274 PreInvPairs, 384 NumberOfFragments, 2629 HoareAnnotationTreeSize, 274 FomulaSimplifications, 45176401 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 48 FomulaSimplificationsInter, 858879 FormulaSimplificationTreeSizeReductionInter, 17.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1119 ConstructedInterpolants, 0 QuantifiedInterpolants, 632519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 111/980 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...