/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/recursive-simple/id_o20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:55:39,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:55:39,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:55:39,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:55:39,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:55:39,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:55:39,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:55:39,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:55:39,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:55:39,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:55:39,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:55:39,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:55:39,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:55:39,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:55:39,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:55:39,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:55:39,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:55:39,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:55:39,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:55:39,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:55:39,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:55:39,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:55:39,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:55:39,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:55:39,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:55:39,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:55:39,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:55:39,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:55:39,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:55:39,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:55:39,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:55:39,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:55:39,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:55:39,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:55:39,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:55:39,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:55:39,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:55:39,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:55:39,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:55:39,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:55:39,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:55:39,809 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 00:55:39,835 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:55:39,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:55:39,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:55:39,840 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:55:39,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:55:39,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:55:39,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:55:39,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:55:39,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:55:39,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:55:39,843 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:55:39,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:55:39,844 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:55:39,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:55:39,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:55:39,845 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:55:39,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:55:39,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:55:39,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:55:39,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:55:39,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:55:39,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:55:39,847 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 00:55:40,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:55:40,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:55:40,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:55:40,344 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:55:40,344 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:55:40,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c [2020-10-24 00:55:40,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c2f9a10/8aeba7a1c65a474d85fcb12914bd4a37/FLAG1f4c0fa5c [2020-10-24 00:55:41,057 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:55:41,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o20.c [2020-10-24 00:55:41,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c2f9a10/8aeba7a1c65a474d85fcb12914bd4a37/FLAG1f4c0fa5c [2020-10-24 00:55:41,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c2f9a10/8aeba7a1c65a474d85fcb12914bd4a37 [2020-10-24 00:55:41,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:55:41,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:55:41,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:41,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:55:41,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:55:41,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e75f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41, skipping insertion in model container [2020-10-24 00:55:41,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:55:41,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:55:41,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:41,685 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:55:41,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:41,728 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:55:41,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41 WrapperNode [2020-10-24 00:55:41,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:41,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:55:41,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:55:41,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:55:41,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (1/1) ... [2020-10-24 00:55:41,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:55:41,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:55:41,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:55:41,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:55:41,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (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 00:55:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:55:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:55:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:55:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:55:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:55:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-10-24 00:55:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:55:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:55:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:55:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:55:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:55:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:55:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:55:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:55:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:55:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:55:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:55:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:55:42,187 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:55:42,188 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:55:42,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:42 BoogieIcfgContainer [2020-10-24 00:55:42,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:55:42,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:55:42,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:55:42,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:55:42,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:55:41" (1/3) ... [2020-10-24 00:55:42,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9a7eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:42, skipping insertion in model container [2020-10-24 00:55:42,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:41" (2/3) ... [2020-10-24 00:55:42,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9a7eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:42, skipping insertion in model container [2020-10-24 00:55:42,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:42" (3/3) ... [2020-10-24 00:55:42,201 INFO L111 eAbstractionObserver]: Analyzing ICFG id_o20.c [2020-10-24 00:55:42,221 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:55:42,251 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:55:42,279 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:55:42,344 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:55:42,345 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:55:42,345 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:55:42,347 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:55:42,348 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:55:42,348 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:55:42,348 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:55:42,348 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:55:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-10-24 00:55:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:55:42,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:42,379 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] [2020-10-24 00:55:42,379 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2039876327, now seen corresponding path program 1 times [2020-10-24 00:55:42,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:42,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501468859] [2020-10-24 00:55:42,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,834 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 00:55:42,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501468859] [2020-10-24 00:55:42,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:55:42,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:55:42,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499559480] [2020-10-24 00:55:42,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:55:42,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:55:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:55:42,871 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 6 states. [2020-10-24 00:55:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:43,379 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-24 00:55:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:55:43,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:55:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:43,392 INFO L225 Difference]: With dead ends: 50 [2020-10-24 00:55:43,392 INFO L226 Difference]: Without dead ends: 31 [2020-10-24 00:55:43,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:55:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-24 00:55:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-24 00:55:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-24 00:55:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-10-24 00:55:43,462 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2020-10-24 00:55:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:43,464 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-10-24 00:55:43,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:55:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-10-24 00:55:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 00:55:43,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:43,468 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:43,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:55:43,469 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1789799325, now seen corresponding path program 1 times [2020-10-24 00:55:43,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:43,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232286150] [2020-10-24 00:55:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:55:43,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232286150] [2020-10-24 00:55:43,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:43,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:55:43,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014066508] [2020-10-24 00:55:43,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:55:43,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:55:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:55:43,761 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states. [2020-10-24 00:55:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:44,328 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-10-24 00:55:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:55:44,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-10-24 00:55:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:44,331 INFO L225 Difference]: With dead ends: 41 [2020-10-24 00:55:44,331 INFO L226 Difference]: Without dead ends: 35 [2020-10-24 00:55:44,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-24 00:55:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-24 00:55:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-24 00:55:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-10-24 00:55:44,349 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-10-24 00:55:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:44,350 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-10-24 00:55:44,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:55:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-10-24 00:55:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-24 00:55:44,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:44,352 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-10-24 00:55:44,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:55:44,353 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash 819538851, now seen corresponding path program 2 times [2020-10-24 00:55:44,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:44,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995421693] [2020-10-24 00:55:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-24 00:55:44,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995421693] [2020-10-24 00:55:44,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:44,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:55:44,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422367581] [2020-10-24 00:55:44,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:55:44,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:44,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:55:44,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:55:44,661 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2020-10-24 00:55:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:45,295 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-10-24 00:55:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:55:45,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2020-10-24 00:55:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:45,297 INFO L225 Difference]: With dead ends: 45 [2020-10-24 00:55:45,298 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:55:45,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:55:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:55:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:55:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:55:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-24 00:55:45,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 39 [2020-10-24 00:55:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:45,312 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-24 00:55:45,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:55:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-24 00:55:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 00:55:45,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:45,314 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-10-24 00:55:45,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:55:45,315 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1214666029, now seen corresponding path program 3 times [2020-10-24 00:55:45,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:45,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1698391272] [2020-10-24 00:55:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-24 00:55:45,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1698391272] [2020-10-24 00:55:45,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:45,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:55:45,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162677553] [2020-10-24 00:55:45,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:55:45,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:45,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:55:45,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:55:45,625 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 12 states. [2020-10-24 00:55:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:46,474 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-24 00:55:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:55:46,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-10-24 00:55:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:46,476 INFO L225 Difference]: With dead ends: 49 [2020-10-24 00:55:46,476 INFO L226 Difference]: Without dead ends: 43 [2020-10-24 00:55:46,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:55:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-24 00:55:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-24 00:55:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-24 00:55:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-10-24 00:55:46,490 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 46 [2020-10-24 00:55:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:46,491 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-10-24 00:55:46,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:55:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-10-24 00:55:46,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-24 00:55:46,493 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:46,493 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:46,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:55:46,494 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash -461443027, now seen corresponding path program 4 times [2020-10-24 00:55:46,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:46,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1723065692] [2020-10-24 00:55:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:55:46,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1723065692] [2020-10-24 00:55:46,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:46,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:55:46,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904531590] [2020-10-24 00:55:46,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:55:46,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:46,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:55:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:55:46,851 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 14 states. [2020-10-24 00:55:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:47,912 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-10-24 00:55:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:55:47,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-10-24 00:55:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:47,915 INFO L225 Difference]: With dead ends: 53 [2020-10-24 00:55:47,915 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 00:55:47,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:55:47,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 00:55:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-24 00:55:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 00:55:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-24 00:55:47,930 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 53 [2020-10-24 00:55:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:47,931 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-24 00:55:47,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:55:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-24 00:55:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:55:47,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:47,933 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:47,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:55:47,933 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1951577079, now seen corresponding path program 5 times [2020-10-24 00:55:47,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:47,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105710996] [2020-10-24 00:55:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 00:55:48,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105710996] [2020-10-24 00:55:48,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:48,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:55:48,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281612679] [2020-10-24 00:55:48,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:55:48,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:55:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:55:48,519 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 16 states. [2020-10-24 00:55:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:49,895 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-10-24 00:55:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:55:49,896 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2020-10-24 00:55:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:49,897 INFO L225 Difference]: With dead ends: 57 [2020-10-24 00:55:49,897 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:55:49,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:55:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:55:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:55:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:55:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-10-24 00:55:49,928 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 60 [2020-10-24 00:55:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:49,931 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-10-24 00:55:49,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:55:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-10-24 00:55:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 00:55:49,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:49,938 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:49,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:55:49,939 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1085586761, now seen corresponding path program 6 times [2020-10-24 00:55:49,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:49,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1365366085] [2020-10-24 00:55:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-24 00:55:50,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1365366085] [2020-10-24 00:55:50,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:50,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:55:50,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644823384] [2020-10-24 00:55:50,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:55:50,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:55:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:55:50,573 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 18 states. [2020-10-24 00:55:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:52,157 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-24 00:55:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:55:52,159 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2020-10-24 00:55:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:52,161 INFO L225 Difference]: With dead ends: 61 [2020-10-24 00:55:52,161 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:55:52,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:55:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:55:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-24 00:55:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-24 00:55:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-10-24 00:55:52,192 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 67 [2020-10-24 00:55:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:52,192 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-10-24 00:55:52,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:55:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-10-24 00:55:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-24 00:55:52,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:52,196 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:52,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:55:52,196 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1506086719, now seen corresponding path program 7 times [2020-10-24 00:55:52,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:52,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1312110694] [2020-10-24 00:55:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-24 00:55:52,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1312110694] [2020-10-24 00:55:52,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:52,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:55:52,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814855691] [2020-10-24 00:55:52,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:55:52,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:55:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:55:52,866 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 20 states. [2020-10-24 00:55:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:54,699 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2020-10-24 00:55:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:55:54,699 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2020-10-24 00:55:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:54,701 INFO L225 Difference]: With dead ends: 65 [2020-10-24 00:55:54,701 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:55:54,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=161, Invalid=1819, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 00:55:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:55:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-24 00:55:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 00:55:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-24 00:55:54,716 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 74 [2020-10-24 00:55:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:54,718 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-24 00:55:54,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:55:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-24 00:55:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:55:54,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:54,720 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:54,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:55:54,721 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1924014913, now seen corresponding path program 8 times [2020-10-24 00:55:54,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:54,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19134853] [2020-10-24 00:55:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-24 00:55:55,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19134853] [2020-10-24 00:55:55,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:55,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:55:55,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617776193] [2020-10-24 00:55:55,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:55:55,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:55:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:55:55,475 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 22 states. [2020-10-24 00:55:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:57,588 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-24 00:55:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-24 00:55:57,589 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2020-10-24 00:55:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:57,591 INFO L225 Difference]: With dead ends: 69 [2020-10-24 00:55:57,591 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 00:55:57,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=180, Invalid=2270, Unknown=0, NotChecked=0, Total=2450 [2020-10-24 00:55:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 00:55:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 00:55:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 00:55:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-10-24 00:55:57,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 81 [2020-10-24 00:55:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:57,610 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-10-24 00:55:57,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:55:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-10-24 00:55:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-24 00:55:57,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:57,611 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:57,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:55:57,611 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1815934069, now seen corresponding path program 9 times [2020-10-24 00:55:57,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:57,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127675716] [2020-10-24 00:55:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:57,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:57,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:57,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:57,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:57,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:57,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:58,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:58,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:58,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:58,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:58,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-24 00:55:58,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127675716] [2020-10-24 00:55:58,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:58,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:55:58,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864515475] [2020-10-24 00:55:58,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:55:58,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:55:58,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:55:58,447 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states. [2020-10-24 00:56:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:00,944 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-10-24 00:56:00,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-24 00:56:00,944 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2020-10-24 00:56:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:00,946 INFO L225 Difference]: With dead ends: 73 [2020-10-24 00:56:00,947 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 00:56:00,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=199, Invalid=2771, Unknown=0, NotChecked=0, Total=2970 [2020-10-24 00:56:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 00:56:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-24 00:56:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 00:56:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-24 00:56:00,961 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 88 [2020-10-24 00:56:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:00,963 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-24 00:56:00,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:56:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-24 00:56:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-24 00:56:00,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:00,965 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:00,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:56:00,965 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1550347829, now seen corresponding path program 10 times [2020-10-24 00:56:00,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:00,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [534388925] [2020-10-24 00:56:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-24 00:56:01,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [534388925] [2020-10-24 00:56:01,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:01,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:56:01,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168005498] [2020-10-24 00:56:01,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:56:01,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:56:01,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:56:01,863 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 26 states. [2020-10-24 00:56:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:04,625 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2020-10-24 00:56:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-24 00:56:04,626 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2020-10-24 00:56:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:04,627 INFO L225 Difference]: With dead ends: 77 [2020-10-24 00:56:04,627 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 00:56:04,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=218, Invalid=3322, Unknown=0, NotChecked=0, Total=3540 [2020-10-24 00:56:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 00:56:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-24 00:56:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-24 00:56:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2020-10-24 00:56:04,642 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 95 [2020-10-24 00:56:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:04,643 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2020-10-24 00:56:04,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:56:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2020-10-24 00:56:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-24 00:56:04,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:04,644 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 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 00:56:04,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:56:04,645 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:04,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1156643755, now seen corresponding path program 11 times [2020-10-24 00:56:04,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:04,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433998811] [2020-10-24 00:56:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:04,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:04,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:04,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:04,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:04,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:04,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-24 00:56:05,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433998811] [2020-10-24 00:56:05,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:05,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:56:05,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226123916] [2020-10-24 00:56:05,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:56:05,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:05,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:56:05,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:56:05,612 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 28 states. [2020-10-24 00:56:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:08,662 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-10-24 00:56:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-10-24 00:56:08,663 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 102 [2020-10-24 00:56:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:08,664 INFO L225 Difference]: With dead ends: 81 [2020-10-24 00:56:08,664 INFO L226 Difference]: Without dead ends: 75 [2020-10-24 00:56:08,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=237, Invalid=3923, Unknown=0, NotChecked=0, Total=4160 [2020-10-24 00:56:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-24 00:56:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-10-24 00:56:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 00:56:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-10-24 00:56:08,679 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 102 [2020-10-24 00:56:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:08,680 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-10-24 00:56:08,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:56:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-10-24 00:56:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-24 00:56:08,681 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:08,681 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 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 00:56:08,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:56:08,682 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1249349205, now seen corresponding path program 12 times [2020-10-24 00:56:08,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:08,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066372232] [2020-10-24 00:56:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-24 00:56:09,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066372232] [2020-10-24 00:56:09,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:09,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-10-24 00:56:09,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135261856] [2020-10-24 00:56:09,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-24 00:56:09,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:09,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-24 00:56:09,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:56:09,845 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 30 states. [2020-10-24 00:56:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:13,436 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2020-10-24 00:56:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-10-24 00:56:13,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 109 [2020-10-24 00:56:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:13,438 INFO L225 Difference]: With dead ends: 85 [2020-10-24 00:56:13,438 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:56:13,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=256, Invalid=4574, Unknown=0, NotChecked=0, Total=4830 [2020-10-24 00:56:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:56:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-24 00:56:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:56:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-10-24 00:56:13,455 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 109 [2020-10-24 00:56:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:13,456 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-10-24 00:56:13,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-24 00:56:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-10-24 00:56:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-24 00:56:13,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:13,457 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 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 00:56:13,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:56:13,457 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash 46324511, now seen corresponding path program 13 times [2020-10-24 00:56:13,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:13,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810114070] [2020-10-24 00:56:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:13,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:13,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:13,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:13,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:13,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:13,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:13,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-24 00:56:14,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810114070] [2020-10-24 00:56:14,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:14,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2020-10-24 00:56:14,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863255936] [2020-10-24 00:56:14,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-10-24 00:56:14,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-10-24 00:56:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:56:14,681 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 32 states. [2020-10-24 00:56:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:18,903 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-24 00:56:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-10-24 00:56:18,904 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 116 [2020-10-24 00:56:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:18,906 INFO L225 Difference]: With dead ends: 89 [2020-10-24 00:56:18,907 INFO L226 Difference]: Without dead ends: 83 [2020-10-24 00:56:18,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=275, Invalid=5275, Unknown=0, NotChecked=0, Total=5550 [2020-10-24 00:56:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-24 00:56:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-10-24 00:56:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 00:56:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-10-24 00:56:18,923 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 116 [2020-10-24 00:56:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:18,923 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-10-24 00:56:18,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-10-24 00:56:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-10-24 00:56:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-10-24 00:56:18,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:18,925 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 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 00:56:18,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:56:18,925 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash 322836703, now seen corresponding path program 14 times [2020-10-24 00:56:18,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:18,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649370535] [2020-10-24 00:56:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:19,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:20,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:20,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-24 00:56:20,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649370535] [2020-10-24 00:56:20,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:20,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-10-24 00:56:20,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380908893] [2020-10-24 00:56:20,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-10-24 00:56:20,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:20,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-10-24 00:56:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 00:56:20,359 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 34 states. [2020-10-24 00:56:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:25,209 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2020-10-24 00:56:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-10-24 00:56:25,210 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 123 [2020-10-24 00:56:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:25,212 INFO L225 Difference]: With dead ends: 93 [2020-10-24 00:56:25,212 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:56:25,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=294, Invalid=6026, Unknown=0, NotChecked=0, Total=6320 [2020-10-24 00:56:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:56:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-24 00:56:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 00:56:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-24 00:56:25,227 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 123 [2020-10-24 00:56:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:25,228 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-24 00:56:25,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-10-24 00:56:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-24 00:56:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-10-24 00:56:25,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:25,229 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 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 00:56:25,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:56:25,230 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1510117353, now seen corresponding path program 15 times [2020-10-24 00:56:25,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:25,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076895708] [2020-10-24 00:56:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:25,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-10-24 00:56:26,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076895708] [2020-10-24 00:56:26,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:26,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2020-10-24 00:56:26,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671294454] [2020-10-24 00:56:26,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-10-24 00:56:26,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:26,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-10-24 00:56:26,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 00:56:26,763 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 36 states. [2020-10-24 00:56:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:32,078 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2020-10-24 00:56:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-10-24 00:56:32,080 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 130 [2020-10-24 00:56:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:32,081 INFO L225 Difference]: With dead ends: 97 [2020-10-24 00:56:32,081 INFO L226 Difference]: Without dead ends: 91 [2020-10-24 00:56:32,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=313, Invalid=6827, Unknown=0, NotChecked=0, Total=7140 [2020-10-24 00:56:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-24 00:56:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-24 00:56:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-24 00:56:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2020-10-24 00:56:32,096 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 130 [2020-10-24 00:56:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:32,097 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2020-10-24 00:56:32,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-10-24 00:56:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2020-10-24 00:56:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-24 00:56:32,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:32,098 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 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 00:56:32,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:56:32,098 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1118097047, now seen corresponding path program 16 times [2020-10-24 00:56:32,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:32,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850829335] [2020-10-24 00:56:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:32,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-10-24 00:56:33,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850829335] [2020-10-24 00:56:33,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:33,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2020-10-24 00:56:33,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22879445] [2020-10-24 00:56:33,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-10-24 00:56:33,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:33,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-10-24 00:56:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 00:56:33,828 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 38 states. [2020-10-24 00:56:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:39,811 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-10-24 00:56:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-10-24 00:56:39,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 137 [2020-10-24 00:56:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:39,814 INFO L225 Difference]: With dead ends: 101 [2020-10-24 00:56:39,814 INFO L226 Difference]: Without dead ends: 95 [2020-10-24 00:56:39,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=332, Invalid=7678, Unknown=0, NotChecked=0, Total=8010 [2020-10-24 00:56:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-24 00:56:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-24 00:56:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-24 00:56:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-10-24 00:56:39,833 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 137 [2020-10-24 00:56:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:39,834 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-10-24 00:56:39,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-10-24 00:56:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-10-24 00:56:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-24 00:56:39,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:39,836 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 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 00:56:39,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:56:39,837 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1483874995, now seen corresponding path program 17 times [2020-10-24 00:56:39,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:39,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931420780] [2020-10-24 00:56:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:40,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:41,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:41,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:41,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:41,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:41,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:41,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-10-24 00:56:41,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931420780] [2020-10-24 00:56:42,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:42,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2020-10-24 00:56:42,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142610781] [2020-10-24 00:56:42,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-10-24 00:56:42,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-10-24 00:56:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:56:42,002 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 40 states. [2020-10-24 00:56:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:48,637 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2020-10-24 00:56:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-10-24 00:56:48,638 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 144 [2020-10-24 00:56:48,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:48,639 INFO L225 Difference]: With dead ends: 105 [2020-10-24 00:56:48,639 INFO L226 Difference]: Without dead ends: 99 [2020-10-24 00:56:48,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=351, Invalid=8579, Unknown=0, NotChecked=0, Total=8930 [2020-10-24 00:56:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-24 00:56:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-10-24 00:56:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-24 00:56:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-10-24 00:56:48,653 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-10-24 00:56:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:48,653 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-10-24 00:56:48,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-10-24 00:56:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-10-24 00:56:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-10-24 00:56:48,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:48,654 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 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 00:56:48,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:56:48,655 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2076104691, now seen corresponding path program 18 times [2020-10-24 00:56:48,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:48,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923718580] [2020-10-24 00:56:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-10-24 00:56:50,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923718580] [2020-10-24 00:56:50,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:50,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2020-10-24 00:56:50,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558462678] [2020-10-24 00:56:50,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-10-24 00:56:50,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-10-24 00:56:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 00:56:50,895 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 42 states. [2020-10-24 00:56:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:58,064 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-24 00:56:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2020-10-24 00:56:58,065 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 151 [2020-10-24 00:56:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:58,067 INFO L225 Difference]: With dead ends: 109 [2020-10-24 00:56:58,067 INFO L226 Difference]: Without dead ends: 103 [2020-10-24 00:56:58,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=370, Invalid=9530, Unknown=0, NotChecked=0, Total=9900 [2020-10-24 00:56:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-24 00:56:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-24 00:56:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-24 00:56:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2020-10-24 00:56:58,082 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 151 [2020-10-24 00:56:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:58,083 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2020-10-24 00:56:58,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-10-24 00:56:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2020-10-24 00:56:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-10-24 00:56:58,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:58,084 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 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 00:56:58,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 00:56:58,085 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:58,085 INFO L82 PathProgramCache]: Analyzing trace with hash -566914179, now seen corresponding path program 19 times [2020-10-24 00:56:58,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:58,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [367739406] [2020-10-24 00:56:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:00,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:57:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:00,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:57:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:00,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:57:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-10-24 00:57:00,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [367739406] [2020-10-24 00:57:00,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:00,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2020-10-24 00:57:00,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917403027] [2020-10-24 00:57:00,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-10-24 00:57:00,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-10-24 00:57:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 00:57:00,557 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 44 states. [2020-10-24 00:57:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:08,386 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2020-10-24 00:57:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-10-24 00:57:08,386 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 158 [2020-10-24 00:57:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:08,389 INFO L225 Difference]: With dead ends: 113 [2020-10-24 00:57:08,389 INFO L226 Difference]: Without dead ends: 107 [2020-10-24 00:57:08,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=389, Invalid=10531, Unknown=0, NotChecked=0, Total=10920 [2020-10-24 00:57:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-24 00:57:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-24 00:57:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-24 00:57:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-24 00:57:08,405 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 158 [2020-10-24 00:57:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:08,406 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-24 00:57:08,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-10-24 00:57:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-24 00:57:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-10-24 00:57:08,407 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:08,407 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 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 00:57:08,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 00:57:08,408 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:08,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1423510653, now seen corresponding path program 20 times [2020-10-24 00:57:08,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:08,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702537555] [2020-10-24 00:57:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:57:08,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:57:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:57:08,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:57:08,677 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:57:08,677 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:57:08,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 00:57:08,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:57:08 BoogieIcfgContainer [2020-10-24 00:57:08,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:57:08,764 INFO L168 Benchmark]: Toolchain (without parser) took 87307.16 ms. Allocated memory was 155.2 MB in the beginning and 351.3 MB in the end (delta: 196.1 MB). Free memory was 132.0 MB in the beginning and 291.0 MB in the end (delta: -159.0 MB). Peak memory consumption was 208.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:08,764 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 155.2 MB. Free memory was 130.6 MB in the beginning and 130.6 MB in the end (delta: 34.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:57:08,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.01 ms. Allocated memory is still 155.2 MB. Free memory was 131.4 MB in the beginning and 121.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:08,766 INFO L168 Benchmark]: Boogie Preprocessor took 42.02 ms. Allocated memory is still 155.2 MB. Free memory was 121.9 MB in the beginning and 120.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:08,766 INFO L168 Benchmark]: RCFGBuilder took 413.98 ms. Allocated memory is still 155.2 MB. Free memory was 120.5 MB in the beginning and 107.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:08,767 INFO L168 Benchmark]: TraceAbstraction took 86569.31 ms. Allocated memory was 155.2 MB in the beginning and 351.3 MB in the end (delta: 196.1 MB). Free memory was 107.5 MB in the beginning and 291.0 MB in the end (delta: -183.6 MB). Peak memory consumption was 184.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:08,770 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.21 ms. Allocated memory is still 155.2 MB. Free memory was 130.6 MB in the beginning and 130.6 MB in the end (delta: 34.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 266.01 ms. Allocated memory is still 155.2 MB. Free memory was 131.4 MB in the beginning and 121.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.02 ms. Allocated memory is still 155.2 MB. Free memory was 121.9 MB in the beginning and 120.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 413.98 ms. Allocated memory is still 155.2 MB. Free memory was 120.5 MB in the beginning and 107.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 86569.31 ms. Allocated memory was 155.2 MB in the beginning and 351.3 MB in the end (delta: 196.1 MB). Free memory was 107.5 MB in the beginning and 291.0 MB in the end (delta: -183.6 MB). Peak memory consumption was 184.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] unsigned int input = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=20, input=20] [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 VAL [\old(x)=0, x=0] [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; VAL [\old(x)=11, \result=11, id(x-1)=10, x=11] [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; VAL [\old(x)=12, \result=12, id(x-1)=11, x=12] [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; VAL [\old(x)=13, \result=13, id(x-1)=12, x=13] [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; VAL [\old(x)=14, \result=14, id(x-1)=13, x=14] [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; VAL [\old(x)=15, \result=15, id(x-1)=14, x=15] [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; VAL [\old(x)=16, \result=16, id(x-1)=15, x=16] [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; VAL [\old(x)=17, \result=17, id(x-1)=16, x=17] [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; VAL [\old(x)=18, \result=18, id(x-1)=17, x=18] [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; VAL [\old(x)=19, \result=19, id(x-1)=18, x=19] [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; VAL [\old(x)=20, \result=20, id(x-1)=19, x=20] [L13] RET, EXPR id(input) VAL [id(input)=20, input=20] [L13] unsigned int result = id(input); VAL [id(input)=20, input=20, result=20] [L14] COND TRUE result == 20 VAL [input=20, result=20] [L15] CALL reach_error() [L4] __assert_fail("0", "id_o20.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 86.3s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 64.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 885 SDtfs, 1106 SDslu, 6667 SDs, 0 SdLazy, 27368 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1590 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 1110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13020 ImplicationChecksByTransitivity, 54.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 1995 NumberOfCodeBlocks, 1995 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1810 ConstructedInterpolants, 0 QuantifiedInterpolants, 843390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/8740 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 incorrect! Received shutdown request...