/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_b5_o10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:29,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:29,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:29,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:29,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:29,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:29,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:29,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:29,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:29,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:29,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:29,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:29,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:29,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:29,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:29,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:29,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:29,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:29,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:29,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:29,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:29,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:29,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:29,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:29,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:29,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:29,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:29,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:29,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:29,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:29,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:29,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:29,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:29,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:29,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:29,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:29,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:29,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:29,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:29,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:29,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:29,587 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 00:41:29,613 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:29,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:29,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:29,617 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:29,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:29,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:29,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:29,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:29,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:29,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:29,619 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:29,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:29,620 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:29,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:29,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:29,621 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:29,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:29,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:29,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:29,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:29,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:29,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:29,622 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 [2020-11-07 00:41:30,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:30,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:30,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:30,100 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:30,101 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:30,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b5_o10.c [2020-11-07 00:41:30,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183fde20c/549430e016024f8181c7d70a271e857b/FLAG6549ff635 [2020-11-07 00:41:30,795 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:30,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_b5_o10.c [2020-11-07 00:41:30,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183fde20c/549430e016024f8181c7d70a271e857b/FLAG6549ff635 [2020-11-07 00:41:31,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183fde20c/549430e016024f8181c7d70a271e857b [2020-11-07 00:41:31,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:31,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:31,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:31,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:31,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:31,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50466b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31, skipping insertion in model container [2020-11-07 00:41:31,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:31,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:31,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:31,433 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:31,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:31,477 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:31,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31 WrapperNode [2020-11-07 00:41:31,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:31,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:31,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:31,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:31,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (1/1) ... [2020-11-07 00:41:31,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:31,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:31,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:31,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:31,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (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 00:41:31,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:31,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:31,598 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:31,599 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:41:31,599 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-11-07 00:41:31,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:31,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 00:41:31,599 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:41:31,600 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-11-07 00:41:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:31,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:31,978 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:31,979 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:31,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:31 BoogieIcfgContainer [2020-11-07 00:41:31,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:31,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:31,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:31,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:31,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:31" (1/3) ... [2020-11-07 00:41:31,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8ba8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:31, skipping insertion in model container [2020-11-07 00:41:31,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:31" (2/3) ... [2020-11-07 00:41:31,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8ba8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:31, skipping insertion in model container [2020-11-07 00:41:31,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:31" (3/3) ... [2020-11-07 00:41:31,992 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_b5_o10.c [2020-11-07 00:41:32,008 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:32,011 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:32,025 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:32,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:32,053 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:32,053 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:32,053 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:32,053 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:32,053 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:32,053 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:32,054 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-11-07 00:41:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:32,083 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:32,084 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 00:41:32,084 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:32,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash 138014369, now seen corresponding path program 1 times [2020-11-07 00:41:32,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:32,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687071166] [2020-11-07 00:41:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:32,192 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,533 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 00:41:32,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687071166] [2020-11-07 00:41:32,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:32,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:32,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772799213] [2020-11-07 00:41:32,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:32,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:32,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:32,564 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2020-11-07 00:41:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:33,022 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-11-07 00:41:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:33,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:33,035 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:41:33,035 INFO L226 Difference]: Without dead ends: 45 [2020-11-07 00:41:33,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-07 00:41:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-07 00:41:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-07 00:41:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-11-07 00:41:33,101 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2020-11-07 00:41:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:33,102 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-07 00:41:33,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-11-07 00:41:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 00:41:33,105 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:33,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:33,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:33,106 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1111577060, now seen corresponding path program 1 times [2020-11-07 00:41:33,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:33,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [275377447] [2020-11-07 00:41:33,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:33,110 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,356 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 00:41:33,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [275377447] [2020-11-07 00:41:33,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:33,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:33,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512350337] [2020-11-07 00:41:33,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:33,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:33,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:33,364 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-11-07 00:41:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:33,817 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-11-07 00:41:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:33,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-07 00:41:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:33,820 INFO L225 Difference]: With dead ends: 73 [2020-11-07 00:41:33,821 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:41:33,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:41:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-11-07 00:41:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 00:41:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-11-07 00:41:33,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2020-11-07 00:41:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:33,841 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-11-07 00:41:33,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-11-07 00:41:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 00:41:33,843 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:33,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:33,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:33,844 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 982288804, now seen corresponding path program 1 times [2020-11-07 00:41:33,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:33,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [73682718] [2020-11-07 00:41:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:33,848 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,133 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 00:41:34,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [73682718] [2020-11-07 00:41:34,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:34,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:34,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107932700] [2020-11-07 00:41:34,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:34,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:34,137 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-11-07 00:41:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:34,699 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-11-07 00:41:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:34,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-11-07 00:41:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:34,701 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:41:34,702 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:41:34,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:41:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:41:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:41:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-11-07 00:41:34,718 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2020-11-07 00:41:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:34,719 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-11-07 00:41:34,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-11-07 00:41:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:34,721 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:34,721 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:34,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:34,721 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash 935446002, now seen corresponding path program 1 times [2020-11-07 00:41:34,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:34,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145355414] [2020-11-07 00:41:34,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:34,726 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:34,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145355414] [2020-11-07 00:41:34,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:34,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:34,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834516415] [2020-11-07 00:41:34,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:34,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:34,887 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-11-07 00:41:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:35,228 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-11-07 00:41:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:35,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-11-07 00:41:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:35,231 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:41:35,231 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:41:35,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:41:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-11-07 00:41:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 00:41:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-11-07 00:41:35,248 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2020-11-07 00:41:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:35,248 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-11-07 00:41:35,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-11-07 00:41:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:35,250 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:35,251 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:35,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:35,251 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1355534926, now seen corresponding path program 1 times [2020-11-07 00:41:35,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:35,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28007128] [2020-11-07 00:41:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:35,255 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:35,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28007128] [2020-11-07 00:41:35,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:35,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:35,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938706696] [2020-11-07 00:41:35,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:35,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:35,443 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2020-11-07 00:41:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:36,182 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-11-07 00:41:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:36,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-11-07 00:41:36,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:36,184 INFO L225 Difference]: With dead ends: 85 [2020-11-07 00:41:36,185 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:41:36,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:41:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-11-07 00:41:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 00:41:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-11-07 00:41:36,204 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2020-11-07 00:41:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:36,205 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-11-07 00:41:36,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-11-07 00:41:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:36,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:36,206 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:36,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:36,207 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1484823182, now seen corresponding path program 1 times [2020-11-07 00:41:36,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:36,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371372265] [2020-11-07 00:41:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:36,210 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:36,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:36,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:36,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:36,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:36,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371372265] [2020-11-07 00:41:36,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:36,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:36,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566925913] [2020-11-07 00:41:36,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:36,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:36,498 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2020-11-07 00:41:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:37,538 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2020-11-07 00:41:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:41:37,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-11-07 00:41:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:37,542 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:41:37,542 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:41:37,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:41:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:41:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2020-11-07 00:41:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:41:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-11-07 00:41:37,560 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 43 [2020-11-07 00:41:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:37,560 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-11-07 00:41:37,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-11-07 00:41:37,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:37,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:37,562 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:37,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:41:37,563 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:37,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:37,563 INFO L82 PathProgramCache]: Analyzing trace with hash 463887169, now seen corresponding path program 1 times [2020-11-07 00:41:37,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:37,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [194827473] [2020-11-07 00:41:37,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:37,566 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:37,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [194827473] [2020-11-07 00:41:37,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:37,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:37,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358736196] [2020-11-07 00:41:37,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:37,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:37,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:37,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:37,905 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 9 states. [2020-11-07 00:41:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:38,572 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-11-07 00:41:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:38,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-11-07 00:41:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:38,576 INFO L225 Difference]: With dead ends: 91 [2020-11-07 00:41:38,576 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 00:41:38,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 00:41:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2020-11-07 00:41:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-07 00:41:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-11-07 00:41:38,600 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 52 [2020-11-07 00:41:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:38,601 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-11-07 00:41:38,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-11-07 00:41:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:38,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:38,603 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:38,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:41:38,603 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1827093759, now seen corresponding path program 1 times [2020-11-07 00:41:38,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:38,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390110317] [2020-11-07 00:41:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:38,613 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:38,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390110317] [2020-11-07 00:41:38,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:38,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:38,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416164108] [2020-11-07 00:41:38,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:38,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:38,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:38,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:38,981 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 12 states. [2020-11-07 00:41:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:39,978 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2020-11-07 00:41:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:41:39,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-11-07 00:41:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:39,984 INFO L225 Difference]: With dead ends: 97 [2020-11-07 00:41:39,984 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:41:39,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:41:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:41:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2020-11-07 00:41:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:41:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-11-07 00:41:40,025 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 52 [2020-11-07 00:41:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:40,025 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-11-07 00:41:40,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-11-07 00:41:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:40,027 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:40,028 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:40,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:41:40,028 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1956382015, now seen corresponding path program 1 times [2020-11-07 00:41:40,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:40,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427264994] [2020-11-07 00:41:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:40,032 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:40,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427264994] [2020-11-07 00:41:40,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:40,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:41:40,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282400882] [2020-11-07 00:41:40,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:41:40,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:41:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:40,343 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 15 states. [2020-11-07 00:41:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:41,662 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2020-11-07 00:41:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:41:41,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-11-07 00:41:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:41,664 INFO L225 Difference]: With dead ends: 83 [2020-11-07 00:41:41,664 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:41:41,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:41:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:41:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2020-11-07 00:41:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 00:41:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-11-07 00:41:41,706 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 52 [2020-11-07 00:41:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:41,709 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-11-07 00:41:41,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:41:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-11-07 00:41:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:41,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:41,711 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:41,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:41:41,711 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:41,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1355321149, now seen corresponding path program 1 times [2020-11-07 00:41:41,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:41,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291776856] [2020-11-07 00:41:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:41,714 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:41:42,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1291776856] [2020-11-07 00:41:42,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:42,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:42,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048771668] [2020-11-07 00:41:42,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:42,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:42,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:42,025 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 12 states. [2020-11-07 00:41:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:42,991 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2020-11-07 00:41:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:41:42,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-11-07 00:41:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:42,993 INFO L225 Difference]: With dead ends: 103 [2020-11-07 00:41:42,993 INFO L226 Difference]: Without dead ends: 83 [2020-11-07 00:41:42,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:41:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-07 00:41:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-11-07 00:41:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 00:41:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2020-11-07 00:41:43,031 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 61 [2020-11-07 00:41:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:43,033 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2020-11-07 00:41:43,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2020-11-07 00:41:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:43,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:43,038 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:43,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:41:43,038 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash 648665219, now seen corresponding path program 1 times [2020-11-07 00:41:43,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:43,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520854619] [2020-11-07 00:41:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:43,044 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:41:43,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520854619] [2020-11-07 00:41:43,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:43,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:41:43,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002821141] [2020-11-07 00:41:43,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:41:43,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:43,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:41:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:43,382 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 15 states. [2020-11-07 00:41:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:44,606 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2020-11-07 00:41:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:41:44,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2020-11-07 00:41:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:44,608 INFO L225 Difference]: With dead ends: 109 [2020-11-07 00:41:44,608 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:41:44,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:41:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:41:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2020-11-07 00:41:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 00:41:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2020-11-07 00:41:44,647 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 61 [2020-11-07 00:41:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:44,648 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2020-11-07 00:41:44,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:41:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2020-11-07 00:41:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:44,649 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:44,650 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:44,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:41:44,650 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash 519376963, now seen corresponding path program 2 times [2020-11-07 00:41:44,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:44,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831406980] [2020-11-07 00:41:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:44,653 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:44,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:44,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:44,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:44,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:44,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:41:45,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831406980] [2020-11-07 00:41:45,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:45,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:41:45,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383459168] [2020-11-07 00:41:45,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:41:45,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:41:45,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:41:45,091 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 18 states. [2020-11-07 00:41:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:46,775 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-11-07 00:41:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:41:46,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2020-11-07 00:41:46,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:46,777 INFO L225 Difference]: With dead ends: 95 [2020-11-07 00:41:46,777 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:41:46,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=136, Invalid=1270, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 00:41:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:41:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2020-11-07 00:41:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 00:41:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-11-07 00:41:46,795 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 61 [2020-11-07 00:41:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:46,795 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-11-07 00:41:46,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:41:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-11-07 00:41:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 00:41:46,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:46,796 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:46,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:41:46,797 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1998236834, now seen corresponding path program 1 times [2020-11-07 00:41:46,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:46,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831870514] [2020-11-07 00:41:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:46,799 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:46,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:46,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:46,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:46,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:46,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:47,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:47,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:41:47,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831870514] [2020-11-07 00:41:47,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:47,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:41:47,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678677802] [2020-11-07 00:41:47,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:41:47,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:47,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:41:47,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:47,131 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 15 states. [2020-11-07 00:41:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:48,347 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2020-11-07 00:41:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:41:48,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2020-11-07 00:41:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:48,350 INFO L225 Difference]: With dead ends: 115 [2020-11-07 00:41:48,351 INFO L226 Difference]: Without dead ends: 95 [2020-11-07 00:41:48,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:41:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-07 00:41:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2020-11-07 00:41:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 00:41:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2020-11-07 00:41:48,380 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 70 [2020-11-07 00:41:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:48,381 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2020-11-07 00:41:48,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:41:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2020-11-07 00:41:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 00:41:48,382 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:48,382 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:48,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:41:48,382 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash 5749534, now seen corresponding path program 2 times [2020-11-07 00:41:48,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:48,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902936661] [2020-11-07 00:41:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:48,385 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:41:48,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902936661] [2020-11-07 00:41:48,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:48,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:41:48,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548321160] [2020-11-07 00:41:48,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:41:48,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:48,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:41:48,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:41:48,816 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 18 states. [2020-11-07 00:41:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:50,527 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2020-11-07 00:41:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:41:50,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2020-11-07 00:41:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:50,530 INFO L225 Difference]: With dead ends: 121 [2020-11-07 00:41:50,530 INFO L226 Difference]: Without dead ends: 101 [2020-11-07 00:41:50,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 00:41:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-07 00:41:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2020-11-07 00:41:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-07 00:41:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2020-11-07 00:41:50,554 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 70 [2020-11-07 00:41:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:50,555 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2020-11-07 00:41:50,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:41:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2020-11-07 00:41:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 00:41:50,555 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:50,556 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:50,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:41:50,556 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash -123538722, now seen corresponding path program 2 times [2020-11-07 00:41:50,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:50,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649152510] [2020-11-07 00:41:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:50,559 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:50,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:50,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:50,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:50,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:50,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:50,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:51,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:41:51,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649152510] [2020-11-07 00:41:51,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:51,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:41:51,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044716821] [2020-11-07 00:41:51,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:41:51,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:41:51,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:41:51,099 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 21 states. [2020-11-07 00:41:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:53,357 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2020-11-07 00:41:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:41:53,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 70 [2020-11-07 00:41:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:53,360 INFO L225 Difference]: With dead ends: 109 [2020-11-07 00:41:53,360 INFO L226 Difference]: Without dead ends: 103 [2020-11-07 00:41:53,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=168, Invalid=1902, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 00:41:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-07 00:41:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2020-11-07 00:41:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:41:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2020-11-07 00:41:53,377 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 70 [2020-11-07 00:41:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:53,378 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-11-07 00:41:53,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:41:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-11-07 00:41:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:41:53,378 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:53,379 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:53,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:41:53,379 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 219948884, now seen corresponding path program 1 times [2020-11-07 00:41:53,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:53,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508166362] [2020-11-07 00:41:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:53,381 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 00:41:53,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508166362] [2020-11-07 00:41:53,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:53,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:41:53,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599956381] [2020-11-07 00:41:53,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:41:53,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:41:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:41:53,849 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 18 states. [2020-11-07 00:41:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:55,544 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2020-11-07 00:41:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:41:55,547 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-11-07 00:41:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:55,549 INFO L225 Difference]: With dead ends: 129 [2020-11-07 00:41:55,549 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 00:41:55,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 00:41:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 00:41:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2020-11-07 00:41:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-07 00:41:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2020-11-07 00:41:55,586 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 79 [2020-11-07 00:41:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:55,587 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2020-11-07 00:41:55,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:41:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2020-11-07 00:41:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:41:55,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:55,588 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:55,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:41:55,589 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2071032044, now seen corresponding path program 3 times [2020-11-07 00:41:55,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:55,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1069943843] [2020-11-07 00:41:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:55,592 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 00:41:56,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1069943843] [2020-11-07 00:41:56,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:56,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:41:56,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742350152] [2020-11-07 00:41:56,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:41:56,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:56,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:41:56,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:41:56,175 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 21 states. [2020-11-07 00:41:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:58,494 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2020-11-07 00:41:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:41:58,494 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2020-11-07 00:41:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:58,495 INFO L225 Difference]: With dead ends: 137 [2020-11-07 00:41:58,496 INFO L226 Difference]: Without dead ends: 115 [2020-11-07 00:41:58,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=168, Invalid=1902, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 00:41:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-07 00:41:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2020-11-07 00:41:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-07 00:41:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2020-11-07 00:41:58,521 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 79 [2020-11-07 00:41:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:58,522 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2020-11-07 00:41:58,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:41:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2020-11-07 00:41:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-07 00:41:58,523 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:58,523 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:58,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:41:58,524 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:58,524 INFO L82 PathProgramCache]: Analyzing trace with hash 57233915, now seen corresponding path program 3 times [2020-11-07 00:41:58,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:58,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1085468069] [2020-11-07 00:41:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:58,527 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 00:41:59,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1085468069] [2020-11-07 00:41:59,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:59,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:41:59,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570395340] [2020-11-07 00:41:59,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:41:59,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:59,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:41:59,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:41:59,151 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 21 states. [2020-11-07 00:42:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:01,385 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2020-11-07 00:42:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:42:01,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2020-11-07 00:42:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:01,387 INFO L225 Difference]: With dead ends: 126 [2020-11-07 00:42:01,387 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:42:01,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=168, Invalid=1902, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 00:42:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:42:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:42:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:42:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:42:01,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2020-11-07 00:42:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:01,390 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:42:01,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:42:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:42:01,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:42:01,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:42:01,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:42:01,562 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-11-07 00:42:01,955 WARN L194 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2020-11-07 00:42:02,136 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 85 [2020-11-07 00:42:02,547 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2020-11-07 00:42:03,012 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2020-11-07 00:42:03,275 WARN L194 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2020-11-07 00:42:03,431 WARN L194 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 85 [2020-11-07 00:42:03,722 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 22 [2020-11-07 00:42:03,928 WARN L194 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-11-07 00:42:04,075 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-11-07 00:42:04,648 WARN L194 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2020-11-07 00:42:05,014 WARN L194 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 31 [2020-11-07 00:42:05,232 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 28 [2020-11-07 00:42:05,698 WARN L194 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2020-11-07 00:42:06,012 WARN L194 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-11-07 00:42:06,308 WARN L194 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 26 [2020-11-07 00:42:06,831 WARN L194 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2020-11-07 00:42:07,013 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2020-11-07 00:42:07,336 WARN L194 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-11-07 00:42:07,907 WARN L194 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2020-11-07 00:42:08,202 WARN L194 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2020-11-07 00:42:08,209 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,210 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,210 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,210 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,210 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,210 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,211 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:08,211 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:08,211 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,211 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 00:42:08,211 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,211 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,211 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:42:08,211 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:42:08,211 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4)) (and (<= id2_~ret~1 5) (<= 5 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-11-07 00:42:08,212 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4)) (and (<= id2_~ret~1 5) (<= 5 id2_~ret~1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 6 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-11-07 00:42:08,212 INFO L262 CegarLoopResult]: At program point id2FINAL(lines 16 21) the Hoare annotation is: (or (and (<= |id2_#res| 5) (<= 5 |id2_#res|)) (and (<= |id2_#res| 3) (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= 3 |id2_#res|)) (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4) (<= |id2_#res| 4) (<= 4 |id2_#res|))) [2020-11-07 00:42:08,212 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 00:42:08,212 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 6 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-11-07 00:42:08,212 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 00:42:08,212 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= |id2_#t~ret8| 0)) (and (<= 2 |id2_#t~ret8|) (<= |id2_#t~ret8| 2)) (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3)) (and (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|)) (and (<= |id2_#t~ret8| 5) (<= 5 |id2_#t~ret8|)) (and (<= 4 |id2_#t~ret8|) (<= |id2_#t~ret8| 4))) [2020-11-07 00:42:08,212 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L262 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (<= 4 |id2_#t~ret8|) (<= id2_~ret~1 5) (<= |id2_#t~ret8| 4) (<= 5 id2_~ret~1)) (and (<= 0 |id2_#t~ret8|) (<= 1 id2_~ret~1) (<= |id2_#t~ret8| 0) (<= id2_~ret~1 1)) (and (<= 3 |id2_#t~ret8|) (<= 4 id2_~ret~1) (<= |id2_#t~ret8| 3) (<= id2_~ret~1 4)) (and (<= |id2_#t~ret8| 5) (<= 6 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0) (<= 5 |id2_#t~ret8|)) (and (<= id2_~ret~1 2) (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|) (<= 2 id2_~ret~1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= |id2_#t~ret8| 2) (<= 2 |id2_#t~ret8|))) [2020-11-07 00:42:08,213 INFO L262 CegarLoopResult]: At program point id2EXIT(lines 16 21) the Hoare annotation is: (or (and (<= |id2_#res| 5) (<= 5 |id2_#res|)) (and (<= |id2_#res| 3) (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= 3 |id2_#res|)) (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4) (<= |id2_#res| 4) (<= 4 |id2_#res|))) [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point id2ENTRY(lines 16 21) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 23 29) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-11-07 00:42:08,213 INFO L262 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (< 0 (+ (div main_~result~0 4294967296) 1)) (<= main_~result~0 5)) [2020-11-07 00:42:08,213 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: false [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 00:42:08,213 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 23 29) the Hoare annotation is: true [2020-11-07 00:42:08,214 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 00:42:08,214 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (and (<= |main_#t~ret10| 3) (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|)) (and (<= 4 |main_#t~ret10|) (<= |main_#t~ret10| 4)) (= |main_#t~ret10| 0) (and (<= 5 |main_#t~ret10|) (<= |main_#t~ret10| 5)) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|))) [2020-11-07 00:42:08,214 INFO L269 CegarLoopResult]: At program point L26-2(lines 23 29) the Hoare annotation is: true [2020-11-07 00:42:08,214 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= main_~result~0 3) (<= |main_#t~ret10| 3) .cse0 (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|) (<= main_~result~0 1) .cse0) (and (<= 4 |main_#t~ret10|) (<= main_~result~0 4) (<= |main_#t~ret10| 4) .cse0) (and (= main_~result~0 0) (= |main_#t~ret10| 0)) (and (<= 5 |main_#t~ret10|) (<= |main_#t~ret10| 5) (<= main_~result~0 5) .cse0) (and (<= main_~result~0 2) (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|) .cse0))) [2020-11-07 00:42:08,214 INFO L262 CegarLoopResult]: At program point idFINAL(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 4) (<= id_~ret~0 4) (<= 4 |id_#res|) (<= 4 id_~ret~0)) (and (<= |id_#res| 3) (<= 3 id_~ret~0) (<= id_~ret~0 3) (<= 3 |id_#res|)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 5 |id_#res|) (<= |id_#res| 5))) [2020-11-07 00:42:08,214 INFO L262 CegarLoopResult]: At program point idEXIT(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 4) (<= id_~ret~0 4) (<= 4 |id_#res|) (<= 4 id_~ret~0)) (and (<= |id_#res| 3) (<= 3 id_~ret~0) (<= id_~ret~0 3) (<= 3 |id_#res|)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 5 |id_#res|) (<= |id_#res| 5))) [2020-11-07 00:42:08,214 INFO L269 CegarLoopResult]: At program point idENTRY(lines 9 14) the Hoare annotation is: true [2020-11-07 00:42:08,214 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (and (<= 5 id_~ret~0) (<= id_~ret~0 5)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= id_~ret~0 4) (<= 4 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 00:42:08,215 INFO L262 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (or (and (<= 5 id_~ret~0) (<= id_~ret~0 5)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 6 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 4) (<= 4 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 00:42:08,215 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 00:42:08,215 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 00:42:08,215 INFO L269 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-11-07 00:42:08,215 INFO L262 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (or (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|)) (and (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5)) (and (<= 0 |id_#t~ret7|) (<= |id_#t~ret7| 0)) (and (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3)) (and (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4))) [2020-11-07 00:42:08,215 INFO L269 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-11-07 00:42:08,215 INFO L262 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (or (and (<= id_~ret~0 4) (<= 4 id_~ret~0) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3)) (and (<= 3 id_~ret~0) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= id_~ret~0 3)) (and (<= 5 id_~ret~0) (<= id_~ret~0 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= 6 id_~ret~0) (<= |id_#t~ret7| 5) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 2) (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 id_~ret~0)) (and (<= 0 |id_#t~ret7|) (<= id_~ret~0 1) (<= |id_#t~ret7| 0) (<= 1 id_~ret~0))) [2020-11-07 00:42:08,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:42:08 BoogieIcfgContainer [2020-11-07 00:42:08,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:42:08,249 INFO L168 Benchmark]: Toolchain (without parser) took 37067.16 ms. Allocated memory was 163.6 MB in the beginning and 285.2 MB in the end (delta: 121.6 MB). Free memory was 140.0 MB in the beginning and 116.6 MB in the end (delta: 23.4 MB). Peak memory consumption was 165.9 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:08,250 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 125.8 MB. Free memory is still 100.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:42:08,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.32 ms. Allocated memory is still 163.6 MB. Free memory was 139.3 MB in the beginning and 129.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:08,251 INFO L168 Benchmark]: Boogie Preprocessor took 35.26 ms. Allocated memory is still 163.6 MB. Free memory was 129.6 MB in the beginning and 128.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:08,251 INFO L168 Benchmark]: RCFGBuilder took 466.93 ms. Allocated memory is still 163.6 MB. Free memory was 128.3 MB in the beginning and 139.1 MB in the end (delta: -10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:08,252 INFO L168 Benchmark]: TraceAbstraction took 36262.53 ms. Allocated memory was 163.6 MB in the beginning and 285.2 MB in the end (delta: 121.6 MB). Free memory was 138.7 MB in the beginning and 116.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 163.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:08,255 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.36 ms. Allocated memory is still 125.8 MB. Free memory is still 100.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 289.32 ms. Allocated memory is still 163.6 MB. Free memory was 139.3 MB in the beginning and 129.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.26 ms. Allocated memory is still 163.6 MB. Free memory was 129.6 MB in the beginning and 128.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 466.93 ms. Allocated memory is still 163.6 MB. Free memory was 128.3 MB in the beginning and 139.1 MB in the end (delta: -10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36262.53 ms. Allocated memory was 163.6 MB in the beginning and 285.2 MB in the end (delta: 121.6 MB). Free memory was 138.7 MB in the beginning and 116.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 163.5 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: 16]: Procedure Contract for id2 Derived contract for procedure id2: (((((\result <= 5 && 5 <= \result) || (((\result <= 3 && 3 <= ret) && ret <= 3) && 3 <= \result)) || (((1 <= ret && \result <= 1) && ret <= 1) && 1 <= \result)) || (\result <= 0 && 0 <= \result)) || (((2 <= \result && ret <= 2) && \result <= 2) && 2 <= ret)) || (((4 <= ret && ret <= 4) && \result <= 4) && 4 <= \result) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: (((((((\result <= 4 && ret <= 4) && 4 <= \result) && 4 <= ret) || (((\result <= 3 && 3 <= ret) && ret <= 3) && 3 <= \result)) || (((ret <= 2 && 2 <= \result) && \result <= 2) && 2 <= ret)) || (((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret)) || (0 <= \result && \result <= 0)) || (5 <= \result && \result <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 29.3s, OverallIterations: 18, TraceHistogramMax: 4, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 826 SDtfs, 833 SDslu, 3035 SDs, 0 SdLazy, 9261 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 696 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 462 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 107 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 129 PreInvPairs, 371 NumberOfFragments, 894 HoareAnnotationTreeSize, 129 FomulaSimplifications, 385441 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 50 FomulaSimplificationsInter, 16534 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...