/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/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:28:56,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:28:56,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:28:56,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:28:56,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:28:56,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:28:56,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:28:56,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:28:56,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:28:56,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:28:56,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:28:56,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:28:56,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:28:56,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:28:56,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:28:56,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:28:56,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:28:56,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:28:56,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:28:56,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:28:56,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:28:56,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:28:56,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:28:56,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:28:56,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:28:56,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:28:56,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:28:56,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:28:56,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:28:56,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:28:56,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:28:56,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:28:56,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:28:56,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:28:56,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:28:56,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:28:56,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:28:56,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:28:56,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:28:56,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:28:56,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:28:56,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:28:56,761 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:28:56,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:28:56,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:28:56,767 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:28:56,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:28:56,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:28:56,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:28:56,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:28:56,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:28:56,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:28:56,770 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:28:56,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:28:56,771 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:28:56,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:28:56,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:28:56,772 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:28:56,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:28:56,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:28:56,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:28:56,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:28:56,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:28:56,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:28:56,774 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:28:57,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:28:57,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:28:57,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:28:57,339 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:28:57,340 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:28:57,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-10-24 02:28:57,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028133a34/d8873dbb0d634699a377c081d3aac482/FLAG57c64497b [2020-10-24 02:28:58,132 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:28:58,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-10-24 02:28:58,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028133a34/d8873dbb0d634699a377c081d3aac482/FLAG57c64497b [2020-10-24 02:28:58,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028133a34/d8873dbb0d634699a377c081d3aac482 [2020-10-24 02:28:58,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:28:58,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:28:58,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:28:58,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:28:58,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:28:58,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0efbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58, skipping insertion in model container [2020-10-24 02:28:58,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:28:58,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:28:58,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:28:58,742 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:28:58,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:28:58,808 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:28:58,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58 WrapperNode [2020-10-24 02:28:58,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:28:58,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:28:58,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:28:58,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:28:58,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... [2020-10-24 02:28:58,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:28:58,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:28:58,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:28:58,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:28:58,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:28:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:28:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:28:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:28:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 02:28:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:28:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:28:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:28:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:28:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-24 02:28:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-24 02:28:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:28:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:28:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 02:28:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:28:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:28:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:28:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:28:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:28:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:28:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:28:58,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:28:58,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:28:59,635 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:28:59,635 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 02:28:59,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:28:59 BoogieIcfgContainer [2020-10-24 02:28:59,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:28:59,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:28:59,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:28:59,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:28:59,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:28:58" (1/3) ... [2020-10-24 02:28:59,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f11806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:28:59, skipping insertion in model container [2020-10-24 02:28:59,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:58" (2/3) ... [2020-10-24 02:28:59,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f11806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:28:59, skipping insertion in model container [2020-10-24 02:28:59,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:28:59" (3/3) ... [2020-10-24 02:28:59,652 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-10-24 02:28:59,667 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:28:59,674 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:28:59,689 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:28:59,727 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:28:59,727 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:28:59,727 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:28:59,728 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:28:59,728 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:28:59,728 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:28:59,728 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:28:59,729 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:28:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-10-24 02:28:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 02:28:59,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:59,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:28:59,769 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1775398781, now seen corresponding path program 1 times [2020-10-24 02:28:59,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:59,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1243395648] [2020-10-24 02:28:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:00,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:29:00,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1243395648] [2020-10-24 02:29:00,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:29:00,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 02:29:00,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612456712] [2020-10-24 02:29:00,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 02:29:00,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 02:29:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:29:00,084 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-10-24 02:29:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:00,277 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2020-10-24 02:29:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 02:29:00,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-10-24 02:29:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:00,290 INFO L225 Difference]: With dead ends: 106 [2020-10-24 02:29:00,290 INFO L226 Difference]: Without dead ends: 56 [2020-10-24 02:29:00,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:29:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-24 02:29:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-24 02:29:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-24 02:29:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2020-10-24 02:29:00,375 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 33 [2020-10-24 02:29:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:00,379 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2020-10-24 02:29:00,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 02:29:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2020-10-24 02:29:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-24 02:29:00,383 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:00,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:00,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:29:00,384 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash -136611355, now seen corresponding path program 1 times [2020-10-24 02:29:00,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:00,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511917073] [2020-10-24 02:29:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:00,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:29:00,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511917073] [2020-10-24 02:29:00,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:29:00,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 02:29:00,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016482210] [2020-10-24 02:29:00,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:29:00,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:29:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:29:00,617 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2020-10-24 02:29:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:01,104 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2020-10-24 02:29:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:29:01,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-10-24 02:29:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:01,107 INFO L225 Difference]: With dead ends: 77 [2020-10-24 02:29:01,107 INFO L226 Difference]: Without dead ends: 73 [2020-10-24 02:29:01,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:29:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-24 02:29:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2020-10-24 02:29:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 02:29:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2020-10-24 02:29:01,132 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 35 [2020-10-24 02:29:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:01,133 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2020-10-24 02:29:01,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:29:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-10-24 02:29:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-24 02:29:01,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:01,135 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:01,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:29:01,135 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1196890534, now seen corresponding path program 1 times [2020-10-24 02:29:01,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:01,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2019137852] [2020-10-24 02:29:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:01,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:01,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 02:29:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:29:01,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2019137852] [2020-10-24 02:29:01,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:29:01,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 02:29:01,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398895699] [2020-10-24 02:29:01,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:29:01,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:01,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:29:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:29:01,293 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2020-10-24 02:29:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:01,804 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2020-10-24 02:29:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:29:01,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-10-24 02:29:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:01,807 INFO L225 Difference]: With dead ends: 81 [2020-10-24 02:29:01,807 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 02:29:01,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:29:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 02:29:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2020-10-24 02:29:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-24 02:29:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2020-10-24 02:29:01,830 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 40 [2020-10-24 02:29:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:01,831 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2020-10-24 02:29:01,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:29:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2020-10-24 02:29:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-24 02:29:01,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:01,833 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:01,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:29:01,834 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:01,834 INFO L82 PathProgramCache]: Analyzing trace with hash 132999514, now seen corresponding path program 1 times [2020-10-24 02:29:01,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:01,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1595014421] [2020-10-24 02:29:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:01,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:01,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 02:29:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:02,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-24 02:29:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:29:02,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1595014421] [2020-10-24 02:29:02,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:29:02,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 02:29:02,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096778974] [2020-10-24 02:29:02,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:29:02,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:29:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:29:02,016 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 8 states. [2020-10-24 02:29:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:02,638 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2020-10-24 02:29:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:29:02,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-10-24 02:29:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:02,641 INFO L225 Difference]: With dead ends: 88 [2020-10-24 02:29:02,641 INFO L226 Difference]: Without dead ends: 84 [2020-10-24 02:29:02,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:29:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-24 02:29:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2020-10-24 02:29:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 02:29:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2020-10-24 02:29:02,684 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 48 [2020-10-24 02:29:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:02,684 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2020-10-24 02:29:02,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:29:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2020-10-24 02:29:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-24 02:29:02,690 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:02,691 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:02,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:29:02,695 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:02,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2088261755, now seen corresponding path program 1 times [2020-10-24 02:29:02,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:02,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [798419532] [2020-10-24 02:29:02,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:02,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:02,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 02:29:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:02,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-24 02:29:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:02,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-10-24 02:29:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:29:02,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [798419532] [2020-10-24 02:29:02,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:29:02,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 02:29:02,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206250697] [2020-10-24 02:29:02,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:29:02,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:02,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:29:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:29:02,865 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 9 states. [2020-10-24 02:29:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:03,517 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2020-10-24 02:29:03,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:29:03,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-10-24 02:29:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:03,519 INFO L225 Difference]: With dead ends: 92 [2020-10-24 02:29:03,519 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 02:29:03,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:29:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 02:29:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-10-24 02:29:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-24 02:29:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-10-24 02:29:03,558 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 53 [2020-10-24 02:29:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:03,559 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-10-24 02:29:03,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:29:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-10-24 02:29:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 02:29:03,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:03,564 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:03,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:29:03,566 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash -15556804, now seen corresponding path program 1 times [2020-10-24 02:29:03,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:03,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1937841191] [2020-10-24 02:29:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:03,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:03,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:03,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:29:03,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1937841191] [2020-10-24 02:29:03,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:29:03,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 02:29:03,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811030716] [2020-10-24 02:29:03,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:29:03,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:03,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:29:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:29:03,764 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 8 states. [2020-10-24 02:29:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:04,456 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2020-10-24 02:29:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:29:04,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-10-24 02:29:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:04,459 INFO L225 Difference]: With dead ends: 105 [2020-10-24 02:29:04,459 INFO L226 Difference]: Without dead ends: 101 [2020-10-24 02:29:04,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:29:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-24 02:29:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2020-10-24 02:29:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 02:29:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-10-24 02:29:04,507 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 52 [2020-10-24 02:29:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:04,507 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-10-24 02:29:04,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:29:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-10-24 02:29:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 02:29:04,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:04,509 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:04,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:29:04,510 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:04,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2032807907, now seen corresponding path program 1 times [2020-10-24 02:29:04,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:04,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561056356] [2020-10-24 02:29:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:04,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:04,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:04,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:04,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:29:04,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561056356] [2020-10-24 02:29:04,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:29:04,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 02:29:04,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468116225] [2020-10-24 02:29:04,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:29:04,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:29:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:29:04,674 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 10 states. [2020-10-24 02:29:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:05,497 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2020-10-24 02:29:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:29:05,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-24 02:29:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:05,499 INFO L225 Difference]: With dead ends: 109 [2020-10-24 02:29:05,500 INFO L226 Difference]: Without dead ends: 105 [2020-10-24 02:29:05,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:29:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-24 02:29:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2020-10-24 02:29:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-24 02:29:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2020-10-24 02:29:05,532 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 57 [2020-10-24 02:29:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:05,532 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2020-10-24 02:29:05,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:29:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-10-24 02:29:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 02:29:05,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:05,534 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:05,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:29:05,534 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:05,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1727226990, now seen corresponding path program 1 times [2020-10-24 02:29:05,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:05,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255868309] [2020-10-24 02:29:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:05,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:05,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:05,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:05,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:05,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:29:05,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255868309] [2020-10-24 02:29:05,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:05,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:29:05,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275746552] [2020-10-24 02:29:05,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:29:05,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:05,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:29:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:29:05,650 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 8 states. [2020-10-24 02:29:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:06,205 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2020-10-24 02:29:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:29:06,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2020-10-24 02:29:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:06,208 INFO L225 Difference]: With dead ends: 107 [2020-10-24 02:29:06,208 INFO L226 Difference]: Without dead ends: 103 [2020-10-24 02:29:06,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:29:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-24 02:29:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2020-10-24 02:29:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-24 02:29:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2020-10-24 02:29:06,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 65 [2020-10-24 02:29:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:06,235 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2020-10-24 02:29:06,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:29:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2020-10-24 02:29:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-24 02:29:06,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:06,240 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:06,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:29:06,242 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1471883633, now seen corresponding path program 1 times [2020-10-24 02:29:06,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:06,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1766730711] [2020-10-24 02:29:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:06,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:06,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:06,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:06,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:06,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:06,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-24 02:29:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:29:06,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1766730711] [2020-10-24 02:29:06,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:06,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:29:06,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274886782] [2020-10-24 02:29:06,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:29:06,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:06,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:29:06,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:29:06,482 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 9 states. [2020-10-24 02:29:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:07,142 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2020-10-24 02:29:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:29:07,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-10-24 02:29:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:07,144 INFO L225 Difference]: With dead ends: 111 [2020-10-24 02:29:07,145 INFO L226 Difference]: Without dead ends: 107 [2020-10-24 02:29:07,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:29:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-24 02:29:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2020-10-24 02:29:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-24 02:29:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2020-10-24 02:29:07,177 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 70 [2020-10-24 02:29:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:07,178 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2020-10-24 02:29:07,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:29:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2020-10-24 02:29:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 02:29:07,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:07,179 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:07,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:29:07,180 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1338858127, now seen corresponding path program 1 times [2020-10-24 02:29:07,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:07,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [401093531] [2020-10-24 02:29:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-24 02:29:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:29:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:29:07,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [401093531] [2020-10-24 02:29:07,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:07,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:29:07,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461058766] [2020-10-24 02:29:07,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:29:07,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:07,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:29:07,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:29:07,350 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 10 states. [2020-10-24 02:29:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:08,103 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2020-10-24 02:29:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 02:29:08,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-10-24 02:29:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:08,105 INFO L225 Difference]: With dead ends: 118 [2020-10-24 02:29:08,105 INFO L226 Difference]: Without dead ends: 114 [2020-10-24 02:29:08,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:29:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-24 02:29:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-10-24 02:29:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-24 02:29:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2020-10-24 02:29:08,128 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 78 [2020-10-24 02:29:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:08,129 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2020-10-24 02:29:08,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:29:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2020-10-24 02:29:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-24 02:29:08,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:08,130 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:08,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:29:08,130 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:08,131 INFO L82 PathProgramCache]: Analyzing trace with hash -932748850, now seen corresponding path program 1 times [2020-10-24 02:29:08,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:08,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1466593464] [2020-10-24 02:29:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-24 02:29:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 02:29:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-10-24 02:29:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-24 02:29:08,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1466593464] [2020-10-24 02:29:08,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:08,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:29:08,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831094034] [2020-10-24 02:29:08,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:29:08,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:08,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:29:08,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:29:08,428 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 13 states. [2020-10-24 02:29:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:09,614 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2020-10-24 02:29:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:29:09,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2020-10-24 02:29:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:09,621 INFO L225 Difference]: With dead ends: 122 [2020-10-24 02:29:09,621 INFO L226 Difference]: Without dead ends: 102 [2020-10-24 02:29:09,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2020-10-24 02:29:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-24 02:29:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2020-10-24 02:29:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-24 02:29:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2020-10-24 02:29:09,651 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 83 [2020-10-24 02:29:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:09,651 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2020-10-24 02:29:09,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:29:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2020-10-24 02:29:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-24 02:29:09,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:09,653 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2020-10-24 02:29:09,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:29:09,653 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1268643795, now seen corresponding path program 1 times [2020-10-24 02:29:09,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:09,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548781367] [2020-10-24 02:29:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:29:09,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548781367] [2020-10-24 02:29:09,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:09,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:29:09,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349935889] [2020-10-24 02:29:09,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:29:09,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:09,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:29:09,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:29:09,827 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 10 states. [2020-10-24 02:29:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:10,641 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2020-10-24 02:29:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 02:29:10,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-10-24 02:29:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:10,643 INFO L225 Difference]: With dead ends: 113 [2020-10-24 02:29:10,643 INFO L226 Difference]: Without dead ends: 109 [2020-10-24 02:29:10,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:29:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-24 02:29:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2020-10-24 02:29:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-24 02:29:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2020-10-24 02:29:10,668 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 82 [2020-10-24 02:29:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:10,668 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2020-10-24 02:29:10,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:29:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2020-10-24 02:29:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-24 02:29:10,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:10,670 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2020-10-24 02:29:10,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:29:10,670 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2007080364, now seen corresponding path program 2 times [2020-10-24 02:29:10,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:10,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889325942] [2020-10-24 02:29:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:29:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-24 02:29:10,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1889325942] [2020-10-24 02:29:10,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:10,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:29:10,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452703552] [2020-10-24 02:29:10,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:29:10,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:10,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:29:10,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:29:10,864 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 12 states. [2020-10-24 02:29:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:11,952 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2020-10-24 02:29:11,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:29:11,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2020-10-24 02:29:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:11,955 INFO L225 Difference]: With dead ends: 139 [2020-10-24 02:29:11,955 INFO L226 Difference]: Without dead ends: 135 [2020-10-24 02:29:11,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2020-10-24 02:29:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-24 02:29:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2020-10-24 02:29:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-24 02:29:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2020-10-24 02:29:11,978 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 87 [2020-10-24 02:29:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:11,978 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2020-10-24 02:29:11,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:29:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2020-10-24 02:29:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-24 02:29:11,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:11,980 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2020-10-24 02:29:11,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:29:11,980 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1956054729, now seen corresponding path program 2 times [2020-10-24 02:29:11,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:11,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370056469] [2020-10-24 02:29:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:29:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 02:29:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-10-24 02:29:12,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370056469] [2020-10-24 02:29:12,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:12,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:29:12,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202744160] [2020-10-24 02:29:12,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:29:12,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:29:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:29:12,132 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 10 states. [2020-10-24 02:29:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:12,951 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2020-10-24 02:29:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 02:29:12,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2020-10-24 02:29:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:12,955 INFO L225 Difference]: With dead ends: 124 [2020-10-24 02:29:12,956 INFO L226 Difference]: Without dead ends: 120 [2020-10-24 02:29:12,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:29:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-24 02:29:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-10-24 02:29:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-24 02:29:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2020-10-24 02:29:12,978 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 95 [2020-10-24 02:29:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:12,979 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2020-10-24 02:29:12,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:29:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-10-24 02:29:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-24 02:29:12,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:12,980 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2020-10-24 02:29:12,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:29:12,981 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1734333880, now seen corresponding path program 2 times [2020-10-24 02:29:12,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:12,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812723202] [2020-10-24 02:29:12,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:29:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 02:29:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-10-24 02:29:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-10-24 02:29:13,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812723202] [2020-10-24 02:29:13,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:13,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:29:13,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469372842] [2020-10-24 02:29:13,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:29:13,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:29:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:29:13,240 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 13 states. [2020-10-24 02:29:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:14,563 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2020-10-24 02:29:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:29:14,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2020-10-24 02:29:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:14,565 INFO L225 Difference]: With dead ends: 141 [2020-10-24 02:29:14,565 INFO L226 Difference]: Without dead ends: 137 [2020-10-24 02:29:14,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2020-10-24 02:29:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-24 02:29:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2020-10-24 02:29:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-24 02:29:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2020-10-24 02:29:14,591 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 100 [2020-10-24 02:29:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:14,591 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2020-10-24 02:29:14,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:29:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2020-10-24 02:29:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-24 02:29:14,593 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:14,593 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:14,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:29:14,594 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:14,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1047470264, now seen corresponding path program 2 times [2020-10-24 02:29:14,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:14,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [607863354] [2020-10-24 02:29:14,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:29:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 02:29:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-10-24 02:29:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 02:29:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-10-24 02:29:14,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [607863354] [2020-10-24 02:29:14,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:14,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:29:14,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045721171] [2020-10-24 02:29:14,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:29:14,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:29:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:29:14,787 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 12 states. [2020-10-24 02:29:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:15,734 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2020-10-24 02:29:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:29:15,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-10-24 02:29:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:15,737 INFO L225 Difference]: With dead ends: 141 [2020-10-24 02:29:15,737 INFO L226 Difference]: Without dead ends: 137 [2020-10-24 02:29:15,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-10-24 02:29:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-24 02:29:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-24 02:29:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-24 02:29:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2020-10-24 02:29:15,761 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 108 [2020-10-24 02:29:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:15,762 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2020-10-24 02:29:15,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:29:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2020-10-24 02:29:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-24 02:29:15,763 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:15,763 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:15,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:29:15,764 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:15,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1796819369, now seen corresponding path program 2 times [2020-10-24 02:29:15,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:15,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [818501765] [2020-10-24 02:29:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:29:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 02:29:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-10-24 02:29:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:15,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 02:29:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:16,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-24 02:29:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2020-10-24 02:29:16,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [818501765] [2020-10-24 02:29:16,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:16,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:29:16,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004769734] [2020-10-24 02:29:16,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:29:16,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:29:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:29:16,064 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 13 states. [2020-10-24 02:29:17,022 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-10-24 02:29:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:17,410 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2020-10-24 02:29:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 02:29:17,412 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2020-10-24 02:29:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:17,414 INFO L225 Difference]: With dead ends: 149 [2020-10-24 02:29:17,414 INFO L226 Difference]: Without dead ends: 125 [2020-10-24 02:29:17,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2020-10-24 02:29:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-24 02:29:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-24 02:29:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-24 02:29:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2020-10-24 02:29:17,439 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 113 [2020-10-24 02:29:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:17,439 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2020-10-24 02:29:17,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:29:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2020-10-24 02:29:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-24 02:29:17,441 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:17,441 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-24 02:29:17,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 02:29:17,441 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:17,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1813936715, now seen corresponding path program 3 times [2020-10-24 02:29:17,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:17,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446798000] [2020-10-24 02:29:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:29:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 02:29:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-24 02:29:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-24 02:29:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:29:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2020-10-24 02:29:17,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446798000] [2020-10-24 02:29:17,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:17,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 02:29:17,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184686892] [2020-10-24 02:29:17,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 02:29:17,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:17,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 02:29:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:29:17,831 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 19 states. [2020-10-24 02:29:19,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:19,321 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2020-10-24 02:29:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:29:19,323 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 117 [2020-10-24 02:29:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:19,325 INFO L225 Difference]: With dead ends: 131 [2020-10-24 02:29:19,325 INFO L226 Difference]: Without dead ends: 127 [2020-10-24 02:29:19,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 02:29:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-24 02:29:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-24 02:29:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 02:29:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2020-10-24 02:29:19,351 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 117 [2020-10-24 02:29:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:19,351 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2020-10-24 02:29:19,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 02:29:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2020-10-24 02:29:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-10-24 02:29:19,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:29:19,353 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:29:19,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 02:29:19,353 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:29:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:29:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1975166753, now seen corresponding path program 3 times [2020-10-24 02:29:19,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:29:19,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1256129809] [2020-10-24 02:29:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:29:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:29:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:29:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:29:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:29:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 02:29:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 02:29:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 02:29:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 02:29:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 02:29:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-24 02:29:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-24 02:29:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 02:29:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 02:29:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-10-24 02:29:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:29:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 52 proven. 54 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2020-10-24 02:29:19,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1256129809] [2020-10-24 02:29:19,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:29:19,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:29:19,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704506805] [2020-10-24 02:29:19,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:29:19,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:29:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:29:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:29:19,620 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 13 states. [2020-10-24 02:29:20,576 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-10-24 02:29:20,700 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-10-24 02:29:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:29:20,937 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2020-10-24 02:29:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 02:29:20,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2020-10-24 02:29:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:29:20,939 INFO L225 Difference]: With dead ends: 127 [2020-10-24 02:29:20,939 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:29:20,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-10-24 02:29:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:29:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:29:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:29:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:29:20,941 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2020-10-24 02:29:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:29:20,941 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:29:20,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:29:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:29:20,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:29:20,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 02:29:20,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:29:21,080 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2020-10-24 02:29:21,803 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 78 [2020-10-24 02:29:22,321 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 33 [2020-10-24 02:29:22,517 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-10-24 02:29:22,946 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-10-24 02:29:23,135 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2020-10-24 02:29:23,412 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-10-24 02:29:23,712 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2020-10-24 02:29:24,056 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2020-10-24 02:29:24,300 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2020-10-24 02:29:24,560 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2020-10-24 02:29:25,013 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 26 [2020-10-24 02:29:25,417 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-10-24 02:29:25,658 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2020-10-24 02:29:25,681 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,681 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,681 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,682 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,683 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-10-24 02:29:25,683 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-24 02:29:25,683 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:29:25,683 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:29:25,683 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:29:25,684 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:29:25,684 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:29:25,684 INFO L274 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-10-24 02:29:25,684 INFO L274 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-10-24 02:29:25,684 INFO L274 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-10-24 02:29:25,684 INFO L274 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-10-24 02:29:25,684 INFO L274 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-10-24 02:29:25,684 INFO L277 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-10-24 02:29:25,684 INFO L270 CegarLoopResult]: At program point L31-1(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-10-24 02:29:25,685 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-24 02:29:25,685 INFO L277 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-10-24 02:29:25,685 INFO L277 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-10-24 02:29:25,685 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2020-10-24 02:29:25,685 INFO L270 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-10-24 02:29:25,685 INFO L270 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 main_~bufferlen~0)) [2020-10-24 02:29:25,685 INFO L270 CegarLoopResult]: At program point L44(lines 44 45) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= .cse4 main_~bufferlen~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= 2 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 2) (+ main_~buf~0 main_~inlen~0)) .cse1 .cse2 (<= 1 main_~in~0) .cse3) (and (<= 1 main_~buf~0) .cse0 (= main_~in~0 0) .cse1 .cse2 .cse3)))) [2020-10-24 02:29:25,685 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-10-24 02:29:25,685 INFO L270 CegarLoopResult]: At program point L32(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-10-24 02:29:25,686 INFO L277 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-10-24 02:29:25,686 INFO L277 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-10-24 02:29:25,686 INFO L277 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-10-24 02:29:25,686 INFO L277 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: true [2020-10-24 02:29:25,686 INFO L270 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-10-24 02:29:25,686 INFO L270 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse5)) (.cse1 (<= .cse5 main_~bufferlen~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 (= |main_#t~post7| 0) (= main_~in~0 0) .cse1 .cse2 .cse3) (let ((.cse4 (+ main_~buf~0 main_~inlen~0))) (and .cse0 (<= 2 main_~buf~0) (<= 1 |main_#t~post7|) (<= (+ main_~in~0 main_~bufferlen~0 2) .cse4) .cse1 .cse2 (<= 1 main_~in~0) .cse3 (<= (+ |main_#t~post7| main_~bufferlen~0 2) .cse4)))))) [2020-10-24 02:29:25,686 INFO L270 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse6 (+ main_~buflim~0 2)) (.cse5 (+ main_~buf~0 main_~inlen~0))) (let ((.cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse5)) (.cse1 (<= main_~bufferlen~0 .cse6)) (.cse2 (<= .cse6 main_~bufferlen~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse4 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (= |main_#t~post7| 0) .cse2 .cse3 (<= 1 main_~in~0) .cse4) (and .cse0 .cse1 (<= 2 main_~buf~0) (<= 2 main_~in~0) (<= 1 |main_#t~post7|) .cse2 .cse3 .cse4 (<= (+ |main_#t~post7| main_~bufferlen~0 2) .cse5))))) [2020-10-24 02:29:25,687 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (= main_~in~0 0) .cse1 (< 0 main_~buflim~0) (= main_~buf~0 0) .cse2) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) .cse1 (<= 1 main_~in~0) .cse2)))) [2020-10-24 02:29:25,687 INFO L270 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (= main_~in~0 0) .cse1 (< 0 main_~buflim~0) (= main_~buf~0 0) .cse2) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) .cse1 (<= 1 main_~in~0) .cse2)))) [2020-10-24 02:29:25,687 INFO L270 CegarLoopResult]: At program point L37-1(lines 37 48) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-10-24 02:29:25,687 INFO L270 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-10-24 02:29:25,687 INFO L270 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-10-24 02:29:25,688 INFO L270 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-10-24 02:29:25,688 INFO L270 CegarLoopResult]: At program point L37-5(lines 37 48) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-10-24 02:29:25,688 INFO L277 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-10-24 02:29:25,688 INFO L277 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-10-24 02:29:25,688 INFO L277 CegarLoopResult]: At program point L54-1(line 54) the Hoare annotation is: true [2020-10-24 02:29:25,688 INFO L270 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-10-24 02:29:25,688 INFO L270 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-10-24 02:29:25,689 INFO L270 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-10-24 02:29:25,689 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 24 56) the Hoare annotation is: true [2020-10-24 02:29:25,689 INFO L270 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse2 (<= .cse4 main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (= main_~in~0 0) .cse1 .cse2 (= main_~buf~0 0) .cse3) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 .cse2 (<= 1 main_~in~0) .cse3)))) [2020-10-24 02:29:25,689 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-24 02:29:25,689 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2020-10-24 02:29:25,689 INFO L277 CegarLoopResult]: At program point L55(lines 25 56) the Hoare annotation is: true [2020-10-24 02:29:25,689 INFO L270 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ |main_#t~post8| 2) main_~bufferlen~0) (<= 1 |main_#t~post8|)) (and (= |main_#t~post8| 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-10-24 02:29:25,689 INFO L270 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 1) main_~bufferlen~0))) (or (and (<= 2 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ |main_#t~post8| 2) main_~bufferlen~0) .cse0 (<= 1 |main_#t~post8|)) (and (<= 1 main_~buf~0) (= |main_#t~post8| 0) .cse0))) [2020-10-24 02:29:25,690 INFO L270 CegarLoopResult]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-10-24 02:29:25,690 INFO L270 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse5)) (.cse2 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse3 (<= .cse5 main_~bufferlen~0)) (.cse4 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (let ((.cse0 (+ main_~in~0 main_~bufferlen~0 1))) (and (<= 1 main_~buf~0) (<= .cse0 (+ main_~buf~0 main_~inlen~0)) .cse1 (<= .cse0 (+ |main_#t~post6| main_~inlen~0)) .cse2 .cse3 (<= 1 |main_#t~post6|) (<= 1 main_~in~0) .cse4 (<= (+ |main_#t~post6| 3) main_~bufferlen~0))) (and .cse1 (= main_~in~0 0) .cse2 .cse3 (= |main_#t~post6| 0) (= main_~buf~0 0) .cse4)))) [2020-10-24 02:29:25,690 INFO L270 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= .cse4 main_~bufferlen~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= 2 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ |main_#t~post6| main_~inlen~0)) (<= (+ main_~in~0 main_~bufferlen~0 2) (+ main_~buf~0 main_~inlen~0)) .cse1 .cse2 (<= 1 |main_#t~post6|) (<= 1 main_~in~0) .cse3 (<= (+ |main_#t~post6| 3) main_~bufferlen~0)) (and (<= 1 main_~buf~0) .cse0 (= main_~in~0 0) .cse1 (= |main_#t~post6| 0) .cse2 .cse3)))) [2020-10-24 02:29:25,690 INFO L270 CegarLoopResult]: At program point L39(lines 39 40) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-10-24 02:29:25,690 INFO L270 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-10-24 02:29:25,690 INFO L270 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-10-24 02:29:25,691 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-10-24 02:29:25,691 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-10-24 02:29:25,691 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 02:29:25,691 INFO L270 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-10-24 02:29:25,691 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 02:29:25,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:29:25 BoogieIcfgContainer [2020-10-24 02:29:25,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:29:25,714 INFO L168 Benchmark]: Toolchain (without parser) took 27214.32 ms. Allocated memory was 155.2 MB in the beginning and 339.7 MB in the end (delta: 184.5 MB). Free memory was 131.0 MB in the beginning and 151.0 MB in the end (delta: -20.0 MB). Peak memory consumption was 199.5 MB. Max. memory is 8.0 GB. [2020-10-24 02:29:25,714 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 155.2 MB. Free memory was 128.2 MB in the beginning and 128.1 MB in the end (delta: 111.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:29:25,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.83 ms. Allocated memory is still 155.2 MB. Free memory was 130.5 MB in the beginning and 120.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-10-24 02:29:25,715 INFO L168 Benchmark]: Boogie Preprocessor took 55.85 ms. Allocated memory is still 155.2 MB. Free memory was 120.4 MB in the beginning and 118.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:29:25,716 INFO L168 Benchmark]: RCFGBuilder took 772.58 ms. Allocated memory is still 155.2 MB. Free memory was 118.8 MB in the beginning and 135.8 MB in the end (delta: -17.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. [2020-10-24 02:29:25,716 INFO L168 Benchmark]: TraceAbstraction took 26069.30 ms. Allocated memory was 155.2 MB in the beginning and 339.7 MB in the end (delta: 184.5 MB). Free memory was 135.3 MB in the beginning and 151.0 MB in the end (delta: -15.7 MB). Peak memory consumption was 204.3 MB. Max. memory is 8.0 GB. [2020-10-24 02:29:25,718 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 155.2 MB. Free memory was 128.2 MB in the beginning and 128.1 MB in the end (delta: 111.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 302.83 ms. Allocated memory is still 155.2 MB. Free memory was 130.5 MB in the beginning and 120.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 55.85 ms. Allocated memory is still 155.2 MB. Free memory was 120.4 MB in the beginning and 118.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 772.58 ms. Allocated memory is still 155.2 MB. Free memory was 118.8 MB in the beginning and 135.8 MB in the end (delta: -17.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 26069.30 ms. Allocated memory was 155.2 MB in the beginning and 339.7 MB in the end (delta: 184.5 MB). Free memory was 135.3 MB in the beginning and 151.0 MB in the end (delta: -15.7 MB). Peak memory consumption was 204.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((1 <= buf && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen) && 1 <= in) && bufferlen + 1 <= inlen) || (((((bufferlen <= buflim + 2 && in == 0) && buflim + 2 <= bufferlen) && (0 < buflim || buflim == 0)) && buf == 0) && bufferlen + 1 <= inlen) - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || \old(cond) == cond - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.2s, OverallIterations: 19, TraceHistogramMax: 14, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1066 SDtfs, 1766 SDslu, 2361 SDs, 0 SdLazy, 6543 SolverSat, 932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=16, 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, 19 MinimizatonAttempts, 97 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 410 PreInvPairs, 573 NumberOfFragments, 1195 HoareAnnotationTreeSize, 410 FomulaSimplifications, 1219267 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 68 FomulaSimplificationsInter, 4347 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1446 NumberOfCodeBlocks, 1446 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1427 ConstructedInterpolants, 0 QuantifiedInterpolants, 389645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 1805/1985 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...