/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_i10_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:07:04,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:07:04,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:07:05,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:07:05,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:07:05,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:07:05,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:07:05,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:07:05,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:07:05,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:07:05,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:07:05,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:07:05,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:07:05,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:07:05,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:07:05,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:07:05,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:07:05,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:07:05,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:07:05,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:07:05,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:07:05,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:07:05,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:07:05,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:07:05,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:07:05,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:07:05,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:07:05,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:07:05,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:07:05,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:07:05,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:07:05,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:07:05,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:07:05,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:07:05,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:07:05,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:07:05,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:07:05,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:07:05,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:07:05,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:07:05,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:07:05,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:07:05,111 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:07:05,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:07:05,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:07:05,114 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:07:05,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:07:05,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:07:05,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:07:05,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:07:05,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:07:05,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:07:05,116 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:07:05,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:07:05,116 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:07:05,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:07:05,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:07:05,117 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:07:05,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:07:05,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:07:05,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:05,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:07:05,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:07:05,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:07:05,118 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:07:05,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:07:05,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:07:05,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:07:05,554 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:07:05,555 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:07:05,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-11-07 05:07:05,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e59142b7/37d5add38d344f3ead47306bb68364f6/FLAG971f56094 [2020-11-07 05:07:06,373 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:07:06,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-11-07 05:07:06,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e59142b7/37d5add38d344f3ead47306bb68364f6/FLAG971f56094 [2020-11-07 05:07:06,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e59142b7/37d5add38d344f3ead47306bb68364f6 [2020-11-07 05:07:06,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:07:06,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:07:06,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:06,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:07:06,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:07:06,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:06,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47075755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06, skipping insertion in model container [2020-11-07 05:07:06,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:06,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:07:06,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:07:06,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:06,963 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:07:06,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:06,998 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:07:06,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06 WrapperNode [2020-11-07 05:07:06,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:07,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:07:07,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:07:07,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:07:07,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:07,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:07,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:07,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:07,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:07,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:07,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... [2020-11-07 05:07:07,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:07:07,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:07:07,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:07:07,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:07:07,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:07:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:07:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:07:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:07:07,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:07:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:07:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:07:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:07:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:07:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:07:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:07:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:07:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:07:07,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:07:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:07:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:07:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:07:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:07:07,529 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:07:07,529 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:07:07,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:07 BoogieIcfgContainer [2020-11-07 05:07:07,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:07:07,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:07:07,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:07:07,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:07:07,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:07:06" (1/3) ... [2020-11-07 05:07:07,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e4f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:07, skipping insertion in model container [2020-11-07 05:07:07,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:06" (2/3) ... [2020-11-07 05:07:07,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e4f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:07, skipping insertion in model container [2020-11-07 05:07:07,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:07" (3/3) ... [2020-11-07 05:07:07,541 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2020-11-07 05:07:07,559 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:07:07,563 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:07:07,578 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:07:07,604 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:07:07,605 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:07:07,605 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:07:07,605 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:07:07,605 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:07:07,606 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:07:07,606 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:07:07,606 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:07:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 05:07:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:07:07,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:07,636 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-11-07 05:07:07,637 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 05:07:07,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:07,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743620408] [2020-11-07 05:07:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:07:08,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743620408] [2020-11-07 05:07:08,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:07:08,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:07:08,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445659439] [2020-11-07 05:07:08,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:07:08,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:07:08,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:07:08,122 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 05:07:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:08,558 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-11-07 05:07:08,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:07:08,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:07:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:08,580 INFO L225 Difference]: With dead ends: 50 [2020-11-07 05:07:08,581 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 05:07:08,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 05:07:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 05:07:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 05:07:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 05:07:08,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 05:07:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:08,685 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 05:07:08,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:07:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 05:07:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 05:07:08,689 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:08,690 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:08,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:07:08,691 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 05:07:08,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:08,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1413910681] [2020-11-07 05:07:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:07:08,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1413910681] [2020-11-07 05:07:08,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:08,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:07:08,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245998171] [2020-11-07 05:07:08,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:07:08,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:07:08,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:07:08,908 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 05:07:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:09,162 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 05:07:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:09,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 05:07:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:09,165 INFO L225 Difference]: With dead ends: 44 [2020-11-07 05:07:09,165 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:07:09,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:07:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:07:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:07:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 05:07:09,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 05:07:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:09,197 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 05:07:09,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:07:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 05:07:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 05:07:09,201 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:09,201 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:09,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:07:09,202 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:09,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 05:07:09,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:09,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296050022] [2020-11-07 05:07:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:07:09,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296050022] [2020-11-07 05:07:09,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:09,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:07:09,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433695573] [2020-11-07 05:07:09,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:07:09,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:07:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:07:09,422 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 05:07:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:09,707 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 05:07:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:07:09,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 05:07:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:09,709 INFO L225 Difference]: With dead ends: 49 [2020-11-07 05:07:09,710 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 05:07:09,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 05:07:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 05:07:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 05:07:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 05:07:09,725 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 05:07:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:09,726 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 05:07:09,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:07:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 05:07:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 05:07:09,728 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:09,728 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:09,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:07:09,729 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 05:07:09,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:09,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302414243] [2020-11-07 05:07:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:07:09,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302414243] [2020-11-07 05:07:09,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:09,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:07:09,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384789027] [2020-11-07 05:07:09,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:07:09,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:07:09,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:09,995 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 05:07:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:10,333 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 05:07:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:07:10,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 05:07:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:10,336 INFO L225 Difference]: With dead ends: 54 [2020-11-07 05:07:10,336 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 05:07:10,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 05:07:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 05:07:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 05:07:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 05:07:10,352 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 05:07:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:10,353 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 05:07:10,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:07:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 05:07:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:07:10,355 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:10,355 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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-11-07 05:07:10,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:07:10,356 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 05:07:10,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:10,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183620911] [2020-11-07 05:07:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:07:10,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183620911] [2020-11-07 05:07:10,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:10,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:07:10,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406024008] [2020-11-07 05:07:10,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:07:10,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:10,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:07:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:10,590 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 05:07:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:11,015 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 05:07:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:07:11,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 05:07:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:11,018 INFO L225 Difference]: With dead ends: 59 [2020-11-07 05:07:11,019 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 05:07:11,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 05:07:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 05:07:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 05:07:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 05:07:11,038 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 05:07:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:11,039 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 05:07:11,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:07:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 05:07:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:07:11,041 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:11,041 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 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-11-07 05:07:11,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:07:11,041 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 05:07:11,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:11,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474948824] [2020-11-07 05:07:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 05:07:11,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474948824] [2020-11-07 05:07:11,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:11,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:07:11,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768902236] [2020-11-07 05:07:11,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:07:11,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:11,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:07:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:11,457 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 05:07:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:12,008 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 05:07:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:07:12,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 05:07:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:12,011 INFO L225 Difference]: With dead ends: 64 [2020-11-07 05:07:12,012 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 05:07:12,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 05:07:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 05:07:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 05:07:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 05:07:12,029 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 05:07:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:12,029 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 05:07:12,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:07:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 05:07:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:07:12,031 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:12,031 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 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-11-07 05:07:12,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:07:12,032 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 05:07:12,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:12,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1610193048] [2020-11-07 05:07:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 05:07:12,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1610193048] [2020-11-07 05:07:12,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:12,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:07:12,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306420040] [2020-11-07 05:07:12,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:07:12,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:07:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:07:12,411 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 05:07:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:13,019 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 05:07:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:07:13,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 05:07:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:13,025 INFO L225 Difference]: With dead ends: 69 [2020-11-07 05:07:13,026 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 05:07:13,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 05:07:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 05:07:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 05:07:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 05:07:13,049 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 05:07:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:13,050 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 05:07:13,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:07:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 05:07:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:07:13,052 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:13,052 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 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-11-07 05:07:13,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:07:13,052 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 05:07:13,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:13,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541640459] [2020-11-07 05:07:13,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 05:07:13,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541640459] [2020-11-07 05:07:13,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:13,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:07:13,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86896932] [2020-11-07 05:07:13,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:07:13,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:07:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:13,476 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 05:07:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:14,111 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 05:07:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:07:14,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 05:07:14,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:14,113 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:07:14,114 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:07:14,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:07:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 05:07:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:07:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:07:14,133 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 05:07:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:14,133 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:07:14,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:07:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:07:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 05:07:14,135 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:14,135 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 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-11-07 05:07:14,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:07:14,136 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 05:07:14,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:14,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [529457704] [2020-11-07 05:07:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 05:07:14,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [529457704] [2020-11-07 05:07:14,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:14,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:07:14,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424712945] [2020-11-07 05:07:14,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:07:14,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:07:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:07:14,494 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 05:07:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:15,169 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 05:07:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:07:15,169 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 05:07:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:15,172 INFO L225 Difference]: With dead ends: 79 [2020-11-07 05:07:15,172 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 05:07:15,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 05:07:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 05:07:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 05:07:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 05:07:15,208 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 05:07:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:15,209 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 05:07:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:07:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 05:07:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:07:15,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:15,220 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 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-11-07 05:07:15,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:07:15,221 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 05:07:15,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:15,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497269930] [2020-11-07 05:07:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 05:07:15,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497269930] [2020-11-07 05:07:15,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:15,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:07:15,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323807198] [2020-11-07 05:07:15,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:07:15,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:07:15,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:15,748 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 05:07:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:16,454 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 05:07:16,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:07:16,454 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 05:07:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:16,456 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:07:16,456 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:07:16,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:07:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:07:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 05:07:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:07:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 05:07:16,477 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 05:07:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:16,477 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 05:07:16,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:07:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 05:07:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 05:07:16,479 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:16,479 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 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-11-07 05:07:16,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:07:16,480 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 05:07:16,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:16,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1294312291] [2020-11-07 05:07:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:16,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:16,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:16,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:16,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:16,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:16,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:16,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:17,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:17,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:17,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:17,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:17,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 05:07:17,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1294312291] [2020-11-07 05:07:17,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:17,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 05:07:17,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605402826] [2020-11-07 05:07:17,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 05:07:17,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:17,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 05:07:17,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:07:17,519 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 26 states. [2020-11-07 05:07:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:20,584 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 05:07:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-07 05:07:20,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2020-11-07 05:07:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:20,586 INFO L225 Difference]: With dead ends: 89 [2020-11-07 05:07:20,586 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 05:07:20,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=218, Invalid=3322, Unknown=0, NotChecked=0, Total=3540 [2020-11-07 05:07:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 05:07:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 05:07:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 05:07:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 05:07:20,608 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 05:07:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:20,609 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 05:07:20,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 05:07:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 05:07:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 05:07:20,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:20,611 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 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-11-07 05:07:20,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:07:20,612 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 05:07:20,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:20,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296861954] [2020-11-07 05:07:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 275 proven. 22 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 05:07:21,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296861954] [2020-11-07 05:07:21,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:21,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:07:21,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379369789] [2020-11-07 05:07:21,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:07:21,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:21,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:07:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:21,252 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 05:07:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:22,210 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2020-11-07 05:07:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:07:22,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 05:07:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:22,211 INFO L225 Difference]: With dead ends: 82 [2020-11-07 05:07:22,212 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:07:22,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=654, Unknown=0, NotChecked=0, Total=930 [2020-11-07 05:07:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:07:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:07:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:07:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:07:22,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2020-11-07 05:07:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:22,214 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:07:22,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:07:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:07:22,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:07:22,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:07:22,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:07:23,426 WARN L194 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 05:07:24,036 WARN L194 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 05:07:24,625 WARN L194 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2020-11-07 05:07:25,115 WARN L194 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2020-11-07 05:07:25,750 WARN L194 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2020-11-07 05:07:25,758 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,759 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,759 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,759 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,759 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,759 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,759 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:07:25,760 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:07:25,760 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,761 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:07:25,761 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,761 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-11-07 05:07:25,762 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 10 main_~input~0) [2020-11-07 05:07:25,762 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-11-07 05:07:25,763 INFO L262 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= main_~result~0 10) (<= 10 main_~input~0) (<= 10 main_~result~0)) [2020-11-07 05:07:25,764 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-11-07 05:07:25,764 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 10 main_~input~0) (<= main_~input~0 10)) [2020-11-07 05:07:25,764 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 10) (<= 10 |main_#t~ret8|) (<= 10 main_~input~0)) [2020-11-07 05:07:25,764 INFO L262 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 10 main_~input~0) [2020-11-07 05:07:25,764 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 10) (<= 10 |main_#t~ret8|) (<= 10 main_~input~0)) [2020-11-07 05:07:25,765 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 10) (<= main_~result~0 10) (<= 10 |main_#t~ret8|) (<= 10 main_~input~0) (<= 10 main_~result~0)) [2020-11-07 05:07:25,765 INFO L262 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and .cse0 (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 05:07:25,767 INFO L262 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and .cse0 (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 05:07:25,767 INFO L262 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 05:07:25,767 INFO L269 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-11-07 05:07:25,767 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 05:07:25,768 INFO L262 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and .cse0 (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 05:07:25,768 INFO L262 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-11-07 05:07:25,768 INFO L262 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and .cse0 (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 05:07:25,769 INFO L262 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 05:07:25,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:07:25 BoogieIcfgContainer [2020-11-07 05:07:25,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:07:25,812 INFO L168 Benchmark]: Toolchain (without parser) took 19080.58 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 127.3 MB in the beginning and 240.2 MB in the end (delta: -112.9 MB). Peak memory consumption was 183.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:25,813 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 125.8 MB. Free memory is still 95.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:07:25,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.28 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 117.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:25,820 INFO L168 Benchmark]: Boogie Preprocessor took 34.38 ms. Allocated memory is still 151.0 MB. Free memory was 117.7 MB in the beginning and 116.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:25,821 INFO L168 Benchmark]: RCFGBuilder took 495.89 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 133.3 MB in the end (delta: -17.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:25,822 INFO L168 Benchmark]: TraceAbstraction took 18276.69 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 133.1 MB in the beginning and 240.2 MB in the end (delta: -107.1 MB). Peak memory consumption was 189.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:25,830 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.26 ms. Allocated memory is still 125.8 MB. Free memory is still 95.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 257.28 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 117.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.38 ms. Allocated memory is still 151.0 MB. Free memory was 117.7 MB in the beginning and 116.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 495.89 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 133.3 MB in the end (delta: -17.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18276.69 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 133.1 MB in the beginning and 240.2 MB in the end (delta: -107.1 MB). Peak memory consumption was 189.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 10 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: ((((((((((((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1) || ((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || (((\old(x) == x && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (11 <= \old(x) && \old(x) == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.6s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 380 SDtfs, 734 SDslu, 990 SDs, 0 SdLazy, 2506 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 90 PreInvPairs, 299 NumberOfFragments, 1020 HoareAnnotationTreeSize, 90 FomulaSimplifications, 4396 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 37 FomulaSimplificationsInter, 4214 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 193808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 1067/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...