java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/mapavg4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 21:46:30,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 21:46:30,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 21:46:30,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 21:46:30,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 21:46:30,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 21:46:30,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 21:46:30,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 21:46:30,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 21:46:30,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 21:46:30,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 21:46:30,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 21:46:30,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 21:46:30,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 21:46:30,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 21:46:30,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 21:46:30,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 21:46:30,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 21:46:30,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 21:46:30,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 21:46:30,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 21:46:30,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 21:46:30,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 21:46:30,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 21:46:30,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 21:46:30,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 21:46:30,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 21:46:30,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 21:46:30,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 21:46:30,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 21:46:30,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 21:46:30,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 21:46:30,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 21:46:30,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 21:46:30,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 21:46:30,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 21:46:30,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 21:46:30,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 21:46:30,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 21:46:30,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 21:46:30,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 21:46:30,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 21:46:30,672 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 21:46:30,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 21:46:30,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 21:46:30,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 21:46:30,674 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 21:46:30,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 21:46:30,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 21:46:30,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 21:46:30,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 21:46:30,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 21:46:30,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 21:46:30,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 21:46:30,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 21:46:30,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 21:46:30,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 21:46:30,676 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 21:46:30,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 21:46:30,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 21:46:30,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 21:46:30,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 21:46:30,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 21:46:30,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 21:46:30,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 21:46:30,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 21:46:30,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 21:46:30,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 21:46:30,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 21:46:30,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 21:46:30,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 21:46:30,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 21:46:30,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 21:46:30,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 21:46:30,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 21:46:30,727 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 21:46:30,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapavg4.i [2019-10-01 21:46:30,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9769df1/ee9ff4795f504844855d3790188a1eec/FLAG9b3e8a569 [2019-10-01 21:46:31,207 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 21:46:31,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapavg4.i [2019-10-01 21:46:31,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9769df1/ee9ff4795f504844855d3790188a1eec/FLAG9b3e8a569 [2019-10-01 21:46:31,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9769df1/ee9ff4795f504844855d3790188a1eec [2019-10-01 21:46:31,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 21:46:31,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 21:46:31,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 21:46:31,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 21:46:31,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15161af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31, skipping insertion in model container [2019-10-01 21:46:31,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,654 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 21:46:31,674 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 21:46:31,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,927 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 21:46:31,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:32,113 INFO L192 MainTranslator]: Completed translation [2019-10-01 21:46:32,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32 WrapperNode [2019-10-01 21:46:32,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:32,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 21:46:32,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 21:46:32,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 21:46:32,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (1/1) ... [2019-10-01 21:46:32,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (1/1) ... [2019-10-01 21:46:32,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (1/1) ... [2019-10-01 21:46:32,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (1/1) ... [2019-10-01 21:46:32,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (1/1) ... [2019-10-01 21:46:32,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (1/1) ... [2019-10-01 21:46:32,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (1/1) ... [2019-10-01 21:46:32,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 21:46:32,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 21:46:32,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 21:46:32,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 21:46:32,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (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 [2019-10-01 21:46:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 21:46:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 21:46:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2019-10-01 21:46:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 21:46:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 21:46:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 21:46:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2019-10-01 21:46:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 21:46:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 21:46:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 21:46:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 21:46:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 21:46:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 21:46:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 21:46:32,566 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 21:46:32,567 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 21:46:32,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32 BoogieIcfgContainer [2019-10-01 21:46:32,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 21:46:32,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 21:46:32,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 21:46:32,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 21:46:32,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 09:46:31" (1/3) ... [2019-10-01 21:46:32,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109aace1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:32" (2/3) ... [2019-10-01 21:46:32,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109aace1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32" (3/3) ... [2019-10-01 21:46:32,576 INFO L109 eAbstractionObserver]: Analyzing ICFG mapavg4.i [2019-10-01 21:46:32,586 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 21:46:32,594 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 21:46:32,618 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 21:46:32,646 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 21:46:32,647 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 21:46:32,647 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 21:46:32,647 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 21:46:32,647 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 21:46:32,647 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 21:46:32,648 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 21:46:32,648 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 21:46:32,648 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 21:46:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 21:46:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,671 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,673 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1234592251, now seen corresponding path program 1 times [2019-10-01 21:46:32,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:32,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 21:46:32,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 21:46:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 21:46:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:32,883 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 21:46:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,908 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 21:46:32,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 21:46:32,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 21:46:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,919 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:32,919 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 21:46:32,922 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 21:46:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 21:46:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 21:46:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 21:46:32,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 21:46:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,967 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 21:46:32,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 21:46:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 21:46:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,969 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,970 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1054720325, now seen corresponding path program 1 times [2019-10-01 21:46:32,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:33,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:33,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:33,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:33,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:33,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:33,067 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 21:46:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,103 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 21:46:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:33,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 21:46:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,106 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:33,106 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 21:46:33,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 21:46:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 21:46:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 21:46:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 21:46:33,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 21:46:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,115 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 21:46:33,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 21:46:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 21:46:33,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,117 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:33,118 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1286970653, now seen corresponding path program 1 times [2019-10-01 21:46:33,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 21:46:33,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,209 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 21:46:33,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 21:46:33,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 21:46:33,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 21:46:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 21:46:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:33,353 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 21:46:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,378 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 21:46:33,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:33,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 21:46:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,380 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:33,381 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 21:46:33,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 21:46:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 21:46:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 21:46:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 21:46:33,388 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 21:46:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,389 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 21:46:33,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 21:46:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 21:46:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 21:46:33,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,392 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:33,393 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash -631694085, now seen corresponding path program 1 times [2019-10-01 21:46:33,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:33,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:33,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:33,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:33,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:33,514 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 21:46:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,534 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 21:46:33,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:33,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 21:46:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,536 INFO L225 Difference]: With dead ends: 43 [2019-10-01 21:46:33,536 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 21:46:33,537 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 21:46:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 21:46:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 21:46:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 21:46:33,544 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 21:46:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,548 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 21:46:33,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 21:46:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 21:46:33,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,550 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,550 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash -490156423, now seen corresponding path program 1 times [2019-10-01 21:46:33,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,638 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 21:46:33,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 21:46:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 21:46:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,766 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 21:46:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,801 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 21:46:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 21:46:33,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 21:46:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,803 INFO L225 Difference]: With dead ends: 52 [2019-10-01 21:46:33,804 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 21:46:33,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 21:46:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 21:46:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 21:46:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 21:46:33,814 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 21:46:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,815 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 21:46:33,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 21:46:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 21:46:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 21:46:33,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,816 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:33,817 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1271601755, now seen corresponding path program 2 times [2019-10-01 21:46:33,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,959 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:34,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:34,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:34,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 21:46:34,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 21:46:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 21:46:34,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:34,049 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 21:46:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,085 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 21:46:34,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 21:46:34,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 21:46:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,088 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:34,088 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 21:46:34,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 21:46:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 21:46:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 21:46:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 21:46:34,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 21:46:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,099 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 21:46:34,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 21:46:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 21:46:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 21:46:34,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,101 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:34,101 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2104096189, now seen corresponding path program 3 times [2019-10-01 21:46:34,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:34,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,185 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 21:46:34,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 21:46:34,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 21:46:34,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:34,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:34,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,285 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 21:46:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,335 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 21:46:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 21:46:34,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 21:46:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,339 INFO L225 Difference]: With dead ends: 59 [2019-10-01 21:46:34,339 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 21:46:34,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 21:46:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 21:46:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 21:46:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 21:46:34,347 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 21:46:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,347 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 21:46:34,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 21:46:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 21:46:34,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,349 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 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] [2019-10-01 21:46:34,350 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash 780809725, now seen corresponding path program 4 times [2019-10-01 21:46:34,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,462 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:34,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:34,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:34,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 21:46:34,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:34,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:34,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,597 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 21:46:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,658 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 21:46:34,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 21:46:34,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 21:46:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,659 INFO L225 Difference]: With dead ends: 62 [2019-10-01 21:46:34,659 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 21:46:34,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 21:46:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 21:46:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 21:46:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 21:46:34,673 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 21:46:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,674 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 21:46:34,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 21:46:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 21:46:34,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,676 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2019-10-01 21:46:34,676 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,677 INFO L82 PathProgramCache]: Analyzing trace with hash 387956447, now seen corresponding path program 5 times [2019-10-01 21:46:34,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,816 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:34,857 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,915 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 21:46:34,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 21:46:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 21:46:34,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,989 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 21:46:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,061 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 21:46:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:35,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 21:46:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,063 INFO L225 Difference]: With dead ends: 67 [2019-10-01 21:46:35,063 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 21:46:35,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 21:46:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 21:46:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 21:46:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 21:46:35,070 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 21:46:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,071 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 21:46:35,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 21:46:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 21:46:35,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,072 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 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] [2019-10-01 21:46:35,073 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,073 INFO L82 PathProgramCache]: Analyzing trace with hash -482079969, now seen corresponding path program 6 times [2019-10-01 21:46:35,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 21:46:35,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,181 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,209 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:35,261 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 21:46:35,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 21:46:35,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 21:46:35,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:35,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,307 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 21:46:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,370 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 21:46:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:35,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 21:46:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,372 INFO L225 Difference]: With dead ends: 73 [2019-10-01 21:46:35,372 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 21:46:35,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 21:46:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 21:46:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 21:46:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 21:46:35,385 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 21:46:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,386 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 21:46:35,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 21:46:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 21:46:35,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,388 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 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] [2019-10-01 21:46:35,388 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1276959103, now seen corresponding path program 7 times [2019-10-01 21:46:35,392 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,544 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 21:46:35,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:35,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:35,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,657 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 21:46:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,716 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 21:46:35,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 21:46:35,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 21:46:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,719 INFO L225 Difference]: With dead ends: 76 [2019-10-01 21:46:35,719 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 21:46:35,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 21:46:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 21:46:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 21:46:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 21:46:35,735 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 21:46:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,735 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 21:46:35,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:35,736 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 21:46:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 21:46:35,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,740 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 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] [2019-10-01 21:46:35,740 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash -266850591, now seen corresponding path program 8 times [2019-10-01 21:46:35,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:35,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,883 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:35,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:35,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 21:46:36,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 21:46:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 21:46:36,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:36,006 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 21:46:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,061 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 21:46:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:36,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 21:46:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,063 INFO L225 Difference]: With dead ends: 78 [2019-10-01 21:46:36,066 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 21:46:36,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 21:46:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 21:46:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 21:46:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 21:46:36,077 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 21:46:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,077 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 21:46:36,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 21:46:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 21:46:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 21:46:36,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,079 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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] [2019-10-01 21:46:36,079 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2104249405, now seen corresponding path program 9 times [2019-10-01 21:46:36,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:36,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,218 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:36,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:36,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 21:46:36,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 21:46:36,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 21:46:36,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 21:46:36,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 21:46:36,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:36,374 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 21:46:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,450 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 21:46:36,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 21:46:36,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 21:46:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,453 INFO L225 Difference]: With dead ends: 83 [2019-10-01 21:46:36,453 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 21:46:36,454 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 21:46:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 21:46:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 21:46:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 21:46:36,466 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 21:46:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,466 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 21:46:36,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 21:46:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 21:46:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 21:46:36,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,468 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 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] [2019-10-01 21:46:36,468 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1485183197, now seen corresponding path program 10 times [2019-10-01 21:46:36,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 21:46:36,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,615 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:36,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:36,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:36,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 21:46:36,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 21:46:36,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:36,761 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 21:46:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,849 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 21:46:36,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:36,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 21:46:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,853 INFO L225 Difference]: With dead ends: 89 [2019-10-01 21:46:36,853 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 21:46:36,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 21:46:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 21:46:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 21:46:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 21:46:36,859 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 21:46:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,860 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 21:46:36,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 21:46:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 21:46:36,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,861 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 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] [2019-10-01 21:46:36,861 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1828841827, now seen corresponding path program 11 times [2019-10-01 21:46:36,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 21:46:37,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,004 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:37,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 21:46:37,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:37,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-01 21:46:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 21:46:37,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,384 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 21:46:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,455 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 21:46:37,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:37,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 21:46:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,456 INFO L225 Difference]: With dead ends: 95 [2019-10-01 21:46:37,457 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 21:46:37,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 21:46:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 21:46:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 21:46:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 21:46:37,462 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 21:46:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,463 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 21:46:37,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 21:46:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 21:46:37,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,464 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 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] [2019-10-01 21:46:37,464 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1538721373, now seen corresponding path program 12 times [2019-10-01 21:46:37,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 21:46:37,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,730 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:37,748 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:37,888 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 21:46:37,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:37,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 21:46:37,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 21:46:37,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,947 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 21:46:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,064 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 21:46:38,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:38,065 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 21:46:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,066 INFO L225 Difference]: With dead ends: 101 [2019-10-01 21:46:38,066 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 21:46:38,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 21:46:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 21:46:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 21:46:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 21:46:38,073 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 21:46:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,073 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 21:46:38,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 21:46:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 21:46:38,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,075 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,075 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash 713900035, now seen corresponding path program 13 times [2019-10-01 21:46:38,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:38,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,263 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:38,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 21:46:38,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:38,394 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 21:46:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,473 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 21:46:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 21:46:38,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 21:46:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,477 INFO L225 Difference]: With dead ends: 104 [2019-10-01 21:46:38,477 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 21:46:38,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 21:46:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 21:46:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 21:46:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 21:46:38,484 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 21:46:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,485 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 21:46:38,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 21:46:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 21:46:38,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,486 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,487 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1350791579, now seen corresponding path program 14 times [2019-10-01 21:46:38,487 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:38,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:38,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,711 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:38,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:38,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:38,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 21:46:38,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 21:46:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 21:46:38,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:38,830 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 21:46:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,896 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 21:46:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:38,901 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 21:46:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,902 INFO L225 Difference]: With dead ends: 106 [2019-10-01 21:46:38,902 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 21:46:38,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 21:46:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 21:46:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 21:46:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 21:46:38,907 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 21:46:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,909 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 21:46:38,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 21:46:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 21:46:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 21:46:38,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,910 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,910 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1244541881, now seen corresponding path program 15 times [2019-10-01 21:46:38,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:39,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,144 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:39,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 21:46:39,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:39,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 21:46:39,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:39,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 21:46:39,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:39,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:39,389 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 21:46:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,509 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 21:46:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 21:46:39,509 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 21:46:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,510 INFO L225 Difference]: With dead ends: 111 [2019-10-01 21:46:39,510 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 21:46:39,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 21:46:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 21:46:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 21:46:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 21:46:39,521 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 21:46:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,521 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 21:46:39,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 21:46:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 21:46:39,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,523 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:39,523 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -261735289, now seen corresponding path program 16 times [2019-10-01 21:46:39,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:39,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,778 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:39,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:39,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:39,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:39,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:39,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:39,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 21:46:39,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 21:46:39,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 21:46:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:39,973 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 21:46:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,045 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 21:46:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:40,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 21:46:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,047 INFO L225 Difference]: With dead ends: 114 [2019-10-01 21:46:40,047 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 21:46:40,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 21:46:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 21:46:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 21:46:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 21:46:40,052 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 21:46:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,053 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 21:46:40,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 21:46:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 21:46:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 21:46:40,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,054 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:40,054 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1057421335, now seen corresponding path program 17 times [2019-10-01 21:46:40,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:40,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,337 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:40,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:41,311 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 21:46:41,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:41,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-01 21:46:41,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 21:46:41,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 21:46:41,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 21:46:41,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:41,467 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 21:46:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,589 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 21:46:41,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 21:46:41,590 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 21:46:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,591 INFO L225 Difference]: With dead ends: 119 [2019-10-01 21:46:41,591 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 21:46:41,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 21:46:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 21:46:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 21:46:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 21:46:41,598 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 21:46:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,598 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 21:46:41,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 21:46:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 21:46:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 21:46:41,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,600 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,600 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1308787753, now seen corresponding path program 18 times [2019-10-01 21:46:41,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 21:46:41,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,873 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:41,908 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:42,121 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 21:46:42,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:42,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 21:46:42,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 21:46:42,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:42,217 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 21:46:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,350 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 21:46:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 21:46:42,351 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 21:46:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,352 INFO L225 Difference]: With dead ends: 125 [2019-10-01 21:46:42,352 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 21:46:42,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 21:46:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 21:46:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 21:46:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 21:46:42,358 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 21:46:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,359 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 21:46:42,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 21:46:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 21:46:42,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,361 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:42,361 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash -242984311, now seen corresponding path program 19 times [2019-10-01 21:46:42,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:42,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,664 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:42,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:42,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 21:46:42,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 21:46:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 21:46:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:42,800 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 21:46:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,861 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 21:46:42,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 21:46:42,862 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 21:46:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,863 INFO L225 Difference]: With dead ends: 128 [2019-10-01 21:46:42,863 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 21:46:42,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 21:46:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 21:46:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 21:46:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 21:46:42,868 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 21:46:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,868 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 21:46:42,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 21:46:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 21:46:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 21:46:42,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,871 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:42,871 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1110011285, now seen corresponding path program 20 times [2019-10-01 21:46:42,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:43,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,136 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:43,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:43,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:43,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 21:46:43,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:43,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:43,294 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 21:46:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,378 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 21:46:43,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 21:46:43,378 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 21:46:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,379 INFO L225 Difference]: With dead ends: 130 [2019-10-01 21:46:43,380 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 21:46:43,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 21:46:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 21:46:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 21:46:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 21:46:43,385 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 21:46:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:43,385 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 21:46:43,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 21:46:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 21:46:43,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:43,387 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:43,387 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1099277875, now seen corresponding path program 21 times [2019-10-01 21:46:43,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:43,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:43,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:43,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:43,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 21:46:43,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-01 21:46:43,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 21:46:43,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:43,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:43,926 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 21:46:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:44,066 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 21:46:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 21:46:44,066 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 21:46:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:44,067 INFO L225 Difference]: With dead ends: 135 [2019-10-01 21:46:44,067 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 21:46:44,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 21:46:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 21:46:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 21:46:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 21:46:44,074 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 21:46:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:44,074 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 21:46:44,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 21:46:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 21:46:44,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:44,075 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:44,076 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:44,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1514657069, now seen corresponding path program 22 times [2019-10-01 21:46:44,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:44,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:44,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:44,416 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:44,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:44,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:44,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:44,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 21:46:44,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:44,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:44,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 21:46:44,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:44,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:44,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:44,554 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 21:46:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:44,654 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 21:46:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 21:46:44,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 21:46:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:44,656 INFO L225 Difference]: With dead ends: 138 [2019-10-01 21:46:44,656 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 21:46:44,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 21:46:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 21:46:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 21:46:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 21:46:44,665 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 21:46:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:44,665 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 21:46:44,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 21:46:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 21:46:44,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:44,667 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:44,667 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1289554703, now seen corresponding path program 23 times [2019-10-01 21:46:44,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:44,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:44,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:44,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:45,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:45,074 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:45,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:46,152 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 21:46:46,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:46,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:46,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-01 21:46:46,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:46,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 21:46:46,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 21:46:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 21:46:46,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:46,331 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-01 21:46:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:46,478 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 21:46:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:46,478 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-01 21:46:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:46,479 INFO L225 Difference]: With dead ends: 143 [2019-10-01 21:46:46,480 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 21:46:46,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 21:46:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 21:46:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 21:46:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 21:46:46,488 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 21:46:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:46,489 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 21:46:46,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 21:46:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 21:46:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 21:46:46,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:46,492 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:46,492 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1283933361, now seen corresponding path program 24 times [2019-10-01 21:46:46,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:46,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 21:46:46,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:46,915 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:46,952 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:47,287 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 21:46:47,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:47,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:46:47,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-10-01 21:46:47,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:47,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-01 21:46:47,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 21:46:47,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 21:46:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:47,446 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-01 21:46:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,568 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-01 21:46:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:47,568 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-01 21:46:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,569 INFO L225 Difference]: With dead ends: 149 [2019-10-01 21:46:47,569 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 21:46:47,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 21:46:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-01 21:46:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 21:46:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-01 21:46:47,578 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-01 21:46:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,579 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-01 21:46:47,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 21:46:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-01 21:46:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 21:46:47,581 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,582 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:47,582 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1912835409, now seen corresponding path program 25 times [2019-10-01 21:46:47,582 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:47,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:47,978 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:48,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:48,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 21:46:48,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 21:46:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 21:46:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 21:46:48,125 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-01 21:46:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:48,217 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 21:46:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 21:46:48,219 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-01 21:46:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:48,220 INFO L225 Difference]: With dead ends: 152 [2019-10-01 21:46:48,220 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 21:46:48,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 21:46:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 21:46:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 21:46:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 21:46:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 21:46:48,226 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-01 21:46:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:48,226 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 21:46:48,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 21:46:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 21:46:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 21:46:48,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:48,227 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:48,228 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1736133359, now seen corresponding path program 26 times [2019-10-01 21:46:48,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:48,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:48,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:48,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:48,641 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:48,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:48,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:48,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:48,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:48,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 21:46:48,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:48,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:48,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:48,795 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 21:46:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:48,889 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 21:46:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 21:46:48,890 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 21:46:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:48,891 INFO L225 Difference]: With dead ends: 154 [2019-10-01 21:46:48,891 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 21:46:48,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 21:46:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 21:46:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 21:46:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 21:46:48,897 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 21:46:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:48,898 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 21:46:48,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 21:46:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 21:46:48,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:48,899 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:48,900 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash 570812147, now seen corresponding path program 27 times [2019-10-01 21:46:48,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:49,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:49,511 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:49,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:49,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 21:46:49,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:49,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:49,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2019-10-01 21:46:49,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:49,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-01 21:46:49,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 21:46:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 21:46:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:49,880 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-01 21:46:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:50,057 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-01 21:46:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 21:46:50,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-01 21:46:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:50,059 INFO L225 Difference]: With dead ends: 159 [2019-10-01 21:46:50,059 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 21:46:50,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 21:46:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-01 21:46:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 21:46:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-01 21:46:50,066 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-01 21:46:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:50,066 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-01 21:46:50,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 21:46:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-01 21:46:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 21:46:50,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:50,068 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:50,068 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1027259565, now seen corresponding path program 28 times [2019-10-01 21:46:50,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 21:46:50,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:50,614 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:50,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:50,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:50,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:50,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:50,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-01 21:46:50,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:50,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-01 21:46:50,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 21:46:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 21:46:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:50,939 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-01 21:46:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:51,090 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-01 21:46:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:46:51,091 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-01 21:46:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:51,092 INFO L225 Difference]: With dead ends: 165 [2019-10-01 21:46:51,092 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 21:46:51,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 21:46:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 21:46:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 21:46:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-01 21:46:51,098 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-01 21:46:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:51,098 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-01 21:46:51,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 21:46:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-01 21:46:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 21:46:51,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:51,100 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:51,100 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1026828691, now seen corresponding path program 29 times [2019-10-01 21:46:51,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:51,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 21:46:51,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:51,817 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:51,863 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:47:07,565 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 21:47:07,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:07,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:47:07,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-01 21:47:07,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:07,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 21:47:07,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:07,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:07,788 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-01 21:47:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:07,988 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-01 21:47:07,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:07,990 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-01 21:47:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:07,992 INFO L225 Difference]: With dead ends: 171 [2019-10-01 21:47:07,992 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 21:47:07,994 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 21:47:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-01 21:47:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 21:47:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-01 21:47:08,004 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-01 21:47:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:08,007 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-01 21:47:08,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-01 21:47:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 21:47:08,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:08,010 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:08,010 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash 574332371, now seen corresponding path program 30 times [2019-10-01 21:47:08,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:08,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:08,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:08,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 21:47:08,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:08,654 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:08,694 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:47:11,184 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 21:47:11,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:11,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:47:11,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-01 21:47:11,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-01 21:47:11,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:11,398 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-01 21:47:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:11,584 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-01 21:47:11,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:11,585 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-01 21:47:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:11,586 INFO L225 Difference]: With dead ends: 177 [2019-10-01 21:47:11,586 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 21:47:11,587 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 21:47:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-01 21:47:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 21:47:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 21:47:11,592 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-01 21:47:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:11,592 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 21:47:11,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 21:47:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 21:47:11,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:11,594 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:11,594 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:11,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1218163405, now seen corresponding path program 31 times [2019-10-01 21:47:11,594 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:11,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:11,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:11,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:12,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:12,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:12,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:12,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 21:47:12,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:47:12,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:12,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 21:47:12,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 21:47:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 21:47:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:47:12,405 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-01 21:47:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:12,525 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-01 21:47:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:47:12,526 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-01 21:47:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:12,527 INFO L225 Difference]: With dead ends: 180 [2019-10-01 21:47:12,527 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 21:47:12,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:47:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 21:47:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 21:47:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 21:47:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 21:47:12,535 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-01 21:47:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:12,535 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 21:47:12,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 21:47:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 21:47:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 21:47:12,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:12,537 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:12,537 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1888810859, now seen corresponding path program 32 times [2019-10-01 21:47:12,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:12,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:12,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:12,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:12,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:13,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:13,118 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:13,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:13,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:13,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:13,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 21:47:13,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:13,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:13,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 21:47:13,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 21:47:13,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 21:47:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:13,292 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 21:47:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:13,433 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 21:47:13,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:47:13,433 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 21:47:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:13,435 INFO L225 Difference]: With dead ends: 182 [2019-10-01 21:47:13,435 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 21:47:13,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 21:47:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 21:47:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 21:47:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 21:47:13,441 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 21:47:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:13,441 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 21:47:13,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 21:47:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 21:47:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 21:47:13,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:13,442 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:13,443 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919753, now seen corresponding path program 33 times [2019-10-01 21:47:13,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:13,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:13,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:14,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:14,097 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:14,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 21:47:14,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:14,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:47:14,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2019-10-01 21:47:14,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:14,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-01 21:47:14,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 21:47:14,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 21:47:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:14,547 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-01 21:47:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:14,718 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-01 21:47:14,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 21:47:14,720 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-01 21:47:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:14,722 INFO L225 Difference]: With dead ends: 187 [2019-10-01 21:47:14,722 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 21:47:14,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 21:47:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-01 21:47:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 21:47:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-01 21:47:14,728 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-01 21:47:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:14,728 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-01 21:47:14,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 21:47:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-01 21:47:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 21:47:14,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:14,730 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:14,730 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:14,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1391900713, now seen corresponding path program 34 times [2019-10-01 21:47:14,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:14,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:14,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-10-01 21:47:15,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:15,430 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:15,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:15,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:15,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:15,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:15,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-01 21:47:15,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:15,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 21:47:15,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:47:15,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:47:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:15,853 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-01 21:47:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:16,132 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-01 21:47:16,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:47:16,132 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-01 21:47:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:16,134 INFO L225 Difference]: With dead ends: 193 [2019-10-01 21:47:16,134 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 21:47:16,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 21:47:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 21:47:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 21:47:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-01 21:47:16,141 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-01 21:47:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:16,142 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-01 21:47:16,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:47:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-01 21:47:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 21:47:16,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:16,143 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:16,144 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1808612553, now seen corresponding path program 35 times [2019-10-01 21:47:16,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:16,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:16,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:16,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-10-01 21:47:16,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:16,983 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:17,033 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:48:36,027 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 21:48:36,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:36,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:48:36,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-10-01 21:48:36,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:36,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-01 21:48:36,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 21:48:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 21:48:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:48:36,319 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-01 21:48:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:36,524 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-01 21:48:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 21:48:36,528 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-01 21:48:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:36,530 INFO L225 Difference]: With dead ends: 199 [2019-10-01 21:48:36,530 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 21:48:36,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:48:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 21:48:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-01 21:48:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 21:48:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-01 21:48:36,536 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-01 21:48:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:36,537 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-01 21:48:36,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 21:48:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-01 21:48:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 21:48:36,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:36,538 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:36,538 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 822690679, now seen corresponding path program 36 times [2019-10-01 21:48:36,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:36,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:36,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:36,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-10-01 21:48:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:37,195 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:37,246 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:48:38,886 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 21:48:38,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:38,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:48:38,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-10-01 21:48:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 21:48:39,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 21:48:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 21:48:39,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:48:39,151 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-01 21:48:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:39,390 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-01 21:48:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 21:48:39,391 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-01 21:48:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:39,392 INFO L225 Difference]: With dead ends: 205 [2019-10-01 21:48:39,392 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 21:48:39,393 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:48:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 21:48:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-01 21:48:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 21:48:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-01 21:48:39,398 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-01 21:48:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:39,398 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-01 21:48:39,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 21:48:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-01 21:48:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 21:48:39,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:39,400 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:39,400 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1844433335, now seen corresponding path program 37 times [2019-10-01 21:48:39,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:39,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:39,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:40,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:40,178 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:40,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:40,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 21:48:40,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:40,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:40,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 21:48:40,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 21:48:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 21:48:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:48:40,390 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-01 21:48:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:40,542 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-01 21:48:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:48:40,542 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-01 21:48:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:40,543 INFO L225 Difference]: With dead ends: 208 [2019-10-01 21:48:40,543 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 21:48:40,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:48:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 21:48:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 21:48:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 21:48:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 21:48:40,549 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-01 21:48:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:40,550 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 21:48:40,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 21:48:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 21:48:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 21:48:40,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:40,551 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:40,551 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:40,552 INFO L82 PathProgramCache]: Analyzing trace with hash -847935975, now seen corresponding path program 38 times [2019-10-01 21:48:40,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:40,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:40,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:40,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:41,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:41,334 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:41,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:48:41,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:48:41,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:41,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 21:48:41,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:41,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 21:48:41,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:48:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:48:41,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:48:41,552 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 21:48:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:41,698 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 21:48:41,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:48:41,699 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-01 21:48:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:41,699 INFO L225 Difference]: With dead ends: 210 [2019-10-01 21:48:41,700 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 21:48:41,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:48:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 21:48:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 21:48:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 21:48:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 21:48:41,706 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-01 21:48:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:41,706 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 21:48:41,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:48:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 21:48:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 21:48:41,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:41,708 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:41,708 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1650436603, now seen corresponding path program 39 times [2019-10-01 21:48:41,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:41,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:41,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:41,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:41,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:42,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:42,518 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:42,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:48:43,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 21:48:43,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:43,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:48:43,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2019-10-01 21:48:43,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 21:48:43,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 21:48:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 21:48:43,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:48:43,365 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-01 21:48:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:43,595 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2019-10-01 21:48:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 21:48:43,598 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-01 21:48:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:43,599 INFO L225 Difference]: With dead ends: 215 [2019-10-01 21:48:43,600 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 21:48:43,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:48:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 21:48:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-01 21:48:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 21:48:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-01 21:48:43,606 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-01 21:48:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:43,606 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-01 21:48:43,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 21:48:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-01 21:48:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 21:48:43,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:43,608 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:43,608 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash -796212677, now seen corresponding path program 40 times [2019-10-01 21:48:43,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:43,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:48:44,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:44,411 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:44,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:48:44,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:48:44,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:44,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 21:48:44,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:48:44,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:44,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 21:48:44,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 21:48:44,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 21:48:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:48:44,635 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2019-10-01 21:48:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:44,776 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2019-10-01 21:48:44,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:48:44,780 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2019-10-01 21:48:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:44,781 INFO L225 Difference]: With dead ends: 218 [2019-10-01 21:48:44,782 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 21:48:44,783 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:48:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 21:48:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-01 21:48:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 21:48:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 21:48:44,787 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-01 21:48:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:44,787 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 21:48:44,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 21:48:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 21:48:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 21:48:44,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:44,789 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:44,789 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2135618461, now seen corresponding path program 41 times [2019-10-01 21:48:44,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:44,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:44,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:44,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:44,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:48:45,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:45,739 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:45,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:50:03,385 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 21:50:03,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:03,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:50:03,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2515 trivial. 0 not checked. [2019-10-01 21:50:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:03,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 16] total 58 [2019-10-01 21:50:03,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 21:50:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 21:50:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:50:03,811 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 58 states. [2019-10-01 21:50:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:04,045 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2019-10-01 21:50:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:50:04,045 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-10-01 21:50:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:04,048 INFO L225 Difference]: With dead ends: 223 [2019-10-01 21:50:04,048 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 21:50:04,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:50:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 21:50:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 21:50:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 21:50:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-01 21:50:04,054 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 214 [2019-10-01 21:50:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:04,055 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-01 21:50:04,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 21:50:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-01 21:50:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 21:50:04,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:04,056 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:04,057 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1335465949, now seen corresponding path program 42 times [2019-10-01 21:50:04,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:04,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:04,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 21:50:04,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:04,848 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:04,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:50:09,929 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 21:50:09,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:09,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:50:09,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2777 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:50:10,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:10,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 14] total 57 [2019-10-01 21:50:10,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 21:50:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 21:50:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:50:10,241 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 57 states. [2019-10-01 21:50:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:10,447 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2019-10-01 21:50:10,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 21:50:10,448 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2019-10-01 21:50:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:10,449 INFO L225 Difference]: With dead ends: 229 [2019-10-01 21:50:10,449 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 21:50:10,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:50:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 21:50:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-01 21:50:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 21:50:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-01 21:50:10,457 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 222 [2019-10-01 21:50:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:10,457 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-01 21:50:10,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 21:50:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-01 21:50:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-01 21:50:10,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:10,459 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:10,459 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:10,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2100392131, now seen corresponding path program 43 times [2019-10-01 21:50:10,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:10,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:11,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:11,554 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:50:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:11,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 21:50:11,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:50:11,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:11,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 21:50:11,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 21:50:11,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 21:50:11,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 21:50:11,810 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 47 states. [2019-10-01 21:50:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:11,954 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2019-10-01 21:50:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 21:50:11,954 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 226 [2019-10-01 21:50:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:11,955 INFO L225 Difference]: With dead ends: 232 [2019-10-01 21:50:11,955 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 21:50:11,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 21:50:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 21:50:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-01 21:50:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 21:50:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 21:50:11,965 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 226 [2019-10-01 21:50:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:11,965 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 21:50:11,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 21:50:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 21:50:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 21:50:11,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:11,967 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:11,967 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:11,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash -958157537, now seen corresponding path program 44 times [2019-10-01 21:50:11,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:11,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:11,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:11,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:50:11,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:12,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:12,967 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:13,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:50:13,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:50:13,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:13,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 21:50:13,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:13,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:13,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 21:50:13,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:50:13,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:50:13,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:50:13,216 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 21:50:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:13,367 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 21:50:13,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 21:50:13,367 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 21:50:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:13,368 INFO L225 Difference]: With dead ends: 234 [2019-10-01 21:50:13,368 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 21:50:13,369 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:50:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 21:50:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 21:50:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 21:50:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 21:50:13,375 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 21:50:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:13,375 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 21:50:13,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:50:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 21:50:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 21:50:13,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:13,377 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:13,377 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:13,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1512626817, now seen corresponding path program 45 times [2019-10-01 21:50:13,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:13,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:13,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:14,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:14,315 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:14,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:50:15,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 21:50:15,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:15,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:50:15,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [2019-10-01 21:50:15,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:15,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 15] total 61 [2019-10-01 21:50:15,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 21:50:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 21:50:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:50:15,425 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 61 states. [2019-10-01 21:50:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:15,726 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2019-10-01 21:50:15,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 21:50:15,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 230 [2019-10-01 21:50:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:15,730 INFO L225 Difference]: With dead ends: 239 [2019-10-01 21:50:15,730 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 21:50:15,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:50:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 21:50:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-10-01 21:50:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 21:50:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-10-01 21:50:15,737 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 230 [2019-10-01 21:50:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:15,737 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-10-01 21:50:15,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 21:50:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-10-01 21:50:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-01 21:50:15,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:15,739 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:15,739 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:15,739 INFO L82 PathProgramCache]: Analyzing trace with hash 498874081, now seen corresponding path program 46 times [2019-10-01 21:50:15,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:15,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:15,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:50:16,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:16,665 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:16,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:50:16,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:50:16,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:16,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 21:50:16,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:50:16,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:16,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 21:50:16,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 21:50:16,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 21:50:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:50:16,917 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 50 states. [2019-10-01 21:50:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:17,122 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 21:50:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 21:50:17,123 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 234 [2019-10-01 21:50:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:17,124 INFO L225 Difference]: With dead ends: 242 [2019-10-01 21:50:17,125 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 21:50:17,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:50:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 21:50:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 21:50:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 21:50:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 21:50:17,131 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 234 [2019-10-01 21:50:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:17,132 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 21:50:17,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 21:50:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 21:50:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 21:50:17,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:17,134 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:17,134 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash 567169731, now seen corresponding path program 47 times [2019-10-01 21:50:17,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:17,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:17,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:50:18,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:18,222 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:18,300 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:52:16,094 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 21:52:16,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:16,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:52:16,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3201 trivial. 0 not checked. [2019-10-01 21:52:16,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:16,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 17] total 65 [2019-10-01 21:52:16,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 21:52:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 21:52:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:52:16,626 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 65 states. [2019-10-01 21:52:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:16,898 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2019-10-01 21:52:16,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 21:52:16,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 236 [2019-10-01 21:52:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:16,900 INFO L225 Difference]: With dead ends: 247 [2019-10-01 21:52:16,900 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 21:52:16,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:52:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 21:52:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-10-01 21:52:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-01 21:52:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2019-10-01 21:52:16,918 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 236 [2019-10-01 21:52:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:16,919 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2019-10-01 21:52:16,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 21:52:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2019-10-01 21:52:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-01 21:52:16,920 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:16,921 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:16,921 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:16,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1415206141, now seen corresponding path program 48 times [2019-10-01 21:52:16,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:16,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:16,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:16,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:16,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 21:52:17,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:17,939 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:18,015 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:52:28,606 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 21:52:28,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:28,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:52:28,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2019-10-01 21:52:28,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:28,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 16] total 65 [2019-10-01 21:52:28,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 21:52:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 21:52:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:52:28,989 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 65 states. [2019-10-01 21:52:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:29,335 INFO L93 Difference]: Finished difference Result 253 states and 262 transitions. [2019-10-01 21:52:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 21:52:29,344 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 244 [2019-10-01 21:52:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:29,345 INFO L225 Difference]: With dead ends: 253 [2019-10-01 21:52:29,345 INFO L226 Difference]: Without dead ends: 181 [2019-10-01 21:52:29,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:52:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-01 21:52:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-10-01 21:52:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-01 21:52:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-10-01 21:52:29,351 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 244 [2019-10-01 21:52:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:29,351 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-10-01 21:52:29,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 21:52:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-10-01 21:52:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-01 21:52:29,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:29,353 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:29,353 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:29,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash 437191523, now seen corresponding path program 49 times [2019-10-01 21:52:29,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:29,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:29,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:30,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:30,400 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:30,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:52:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:30,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 21:52:30,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:30,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:30,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 21:52:30,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 21:52:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 21:52:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 21:52:30,669 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 53 states. [2019-10-01 21:52:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:30,867 INFO L93 Difference]: Finished difference Result 256 states and 264 transitions. [2019-10-01 21:52:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 21:52:30,867 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 248 [2019-10-01 21:52:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:30,869 INFO L225 Difference]: With dead ends: 256 [2019-10-01 21:52:30,869 INFO L226 Difference]: Without dead ends: 182 [2019-10-01 21:52:30,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 21:52:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-01 21:52:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-10-01 21:52:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 21:52:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 21:52:30,874 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 248 [2019-10-01 21:52:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:30,875 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 21:52:30,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 21:52:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 21:52:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 21:52:30,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:30,877 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:30,877 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash 243903429, now seen corresponding path program 50 times [2019-10-01 21:52:30,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:30,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:30,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:52:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:31,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:31,934 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:32,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:52:32,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:52:32,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:32,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 21:52:32,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:32,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:32,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 21:52:32,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:52:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:52:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:52:32,208 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 21:52:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:32,405 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 21:52:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 21:52:32,406 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 21:52:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:32,407 INFO L225 Difference]: With dead ends: 258 [2019-10-01 21:52:32,407 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 21:52:32,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:52:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 21:52:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 21:52:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 21:52:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 21:52:32,413 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 21:52:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:32,413 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 21:52:32,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:52:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 21:52:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 21:52:32,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:32,415 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:32,415 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:32,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash -822361177, now seen corresponding path program 51 times [2019-10-01 21:52:32,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:32,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:32,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:32,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:32,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:33,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:33,621 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:33,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:52:34,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 21:52:34,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:34,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:52:34,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3761 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:52:35,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:35,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 17] total 69 [2019-10-01 21:52:35,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 21:52:35,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 21:52:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 21:52:35,290 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 69 states. [2019-10-01 21:52:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:35,611 INFO L93 Difference]: Finished difference Result 263 states and 272 transitions. [2019-10-01 21:52:35,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-01 21:52:35,611 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 252 [2019-10-01 21:52:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:35,612 INFO L225 Difference]: With dead ends: 263 [2019-10-01 21:52:35,612 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 21:52:35,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 21:52:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 21:52:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2019-10-01 21:52:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 21:52:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-10-01 21:52:35,619 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 252 [2019-10-01 21:52:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:35,620 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-10-01 21:52:35,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 21:52:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-10-01 21:52:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-01 21:52:35,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:35,622 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:35,622 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1842577671, now seen corresponding path program 52 times [2019-10-01 21:52:35,622 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:35,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:35,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:35,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:52:36,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:36,777 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:36,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:52:36,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:52:36,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:36,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 21:52:36,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:52:37,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:37,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 21:52:37,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 21:52:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 21:52:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 21:52:37,068 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 56 states. [2019-10-01 21:52:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:37,283 INFO L93 Difference]: Finished difference Result 266 states and 274 transitions. [2019-10-01 21:52:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 21:52:37,284 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 256 [2019-10-01 21:52:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:37,285 INFO L225 Difference]: With dead ends: 266 [2019-10-01 21:52:37,285 INFO L226 Difference]: Without dead ends: 190 [2019-10-01 21:52:37,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 21:52:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-01 21:52:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-10-01 21:52:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 21:52:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 21:52:37,291 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 256 [2019-10-01 21:52:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:37,291 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 21:52:37,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 21:52:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 21:52:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 21:52:37,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:37,293 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:37,293 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash -212293783, now seen corresponding path program 53 times [2019-10-01 21:52:37,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:37,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:37,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:37,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:37,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:52:38,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:38,455 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:38,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:55:18,768 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 21:55:18,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:18,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:55:18,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 3975 trivial. 0 not checked. [2019-10-01 21:55:19,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 18] total 72 [2019-10-01 21:55:19,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-01 21:55:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-01 21:55:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 21:55:19,280 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 72 states. [2019-10-01 21:55:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:19,662 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2019-10-01 21:55:19,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 21:55:19,663 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 258 [2019-10-01 21:55:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:19,665 INFO L225 Difference]: With dead ends: 271 [2019-10-01 21:55:19,665 INFO L226 Difference]: Without dead ends: 195 [2019-10-01 21:55:19,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 21:55:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-01 21:55:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-10-01 21:55:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-01 21:55:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 197 transitions. [2019-10-01 21:55:19,675 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 197 transitions. Word has length 258 [2019-10-01 21:55:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:19,676 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 197 transitions. [2019-10-01 21:55:19,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-01 21:55:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2019-10-01 21:55:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-01 21:55:19,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:19,679 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:19,680 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:19,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1284256681, now seen corresponding path program 54 times [2019-10-01 21:55:19,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:19,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:19,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 21:55:21,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:21,360 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:55:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:56:03,088 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 21:56:03,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:03,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:56:03,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 1098 proven. 225 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2019-10-01 21:56:03,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:03,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 21:56:03,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 21:56:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 21:56:03,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:56:03,608 INFO L87 Difference]: Start difference. First operand 193 states and 197 transitions. Second operand 73 states. [2019-10-01 21:56:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:03,971 INFO L93 Difference]: Finished difference Result 277 states and 286 transitions. [2019-10-01 21:56:03,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 21:56:03,972 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 266 [2019-10-01 21:56:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:03,973 INFO L225 Difference]: With dead ends: 277 [2019-10-01 21:56:03,973 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 21:56:03,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:56:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 21:56:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-10-01 21:56:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-01 21:56:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2019-10-01 21:56:03,980 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 266 [2019-10-01 21:56:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:03,980 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2019-10-01 21:56:03,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 21:56:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2019-10-01 21:56:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-01 21:56:03,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:03,982 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:03,982 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:03,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash -52843255, now seen corresponding path program 55 times [2019-10-01 21:56:03,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:03,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:03,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:03,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:03,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5696 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:05,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:05,247 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:05,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:56:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:05,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 21:56:05,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5696 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (57)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:56:05,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:05,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 21:56:05,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 21:56:05,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 21:56:05,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:56:05,577 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 59 states. [2019-10-01 21:56:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:05,814 INFO L93 Difference]: Finished difference Result 280 states and 288 transitions. [2019-10-01 21:56:05,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:56:05,814 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 270 [2019-10-01 21:56:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:05,815 INFO L225 Difference]: With dead ends: 280 [2019-10-01 21:56:05,815 INFO L226 Difference]: Without dead ends: 200 [2019-10-01 21:56:05,816 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:56:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-01 21:56:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-10-01 21:56:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 21:56:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 21:56:05,822 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 270 [2019-10-01 21:56:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:05,822 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 21:56:05,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 21:56:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 21:56:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 21:56:05,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:05,824 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:05,824 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:05,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash -312279061, now seen corresponding path program 56 times [2019-10-01 21:56:05,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:05,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:05,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:05,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:56:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:07,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:07,120 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:56:07,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:56:07,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:07,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 21:56:07,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:56:07,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:07,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 21:56:07,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 21:56:07,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 21:56:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:56:07,427 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 60 states. [2019-10-01 21:56:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:07,681 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2019-10-01 21:56:07,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 21:56:07,682 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 272 [2019-10-01 21:56:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:07,683 INFO L225 Difference]: With dead ends: 282 [2019-10-01 21:56:07,683 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 21:56:07,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:56:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 21:56:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 21:56:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 21:56:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 21:56:07,691 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 272 [2019-10-01 21:56:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:07,691 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 21:56:07,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 21:56:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 21:56:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 21:56:07,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:07,693 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:07,694 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash -521985459, now seen corresponding path program 57 times [2019-10-01 21:56:07,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:07,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:07,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:07,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:07,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:09,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:09,058 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:09,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:56:11,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 21:56:11,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:11,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:56:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4568 trivial. 0 not checked. [2019-10-01 21:56:11,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:11,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 19] total 77 [2019-10-01 21:56:11,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 21:56:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 21:56:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1940, Invalid=3912, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 21:56:11,857 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 77 states. [2019-10-01 21:56:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:12,303 INFO L93 Difference]: Finished difference Result 287 states and 299 transitions. [2019-10-01 21:56:12,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 21:56:12,303 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 274 [2019-10-01 21:56:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:12,305 INFO L225 Difference]: With dead ends: 287 [2019-10-01 21:56:12,305 INFO L226 Difference]: Without dead ends: 207 [2019-10-01 21:56:12,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1940, Invalid=3912, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 21:56:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-01 21:56:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-10-01 21:56:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 21:56:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-01 21:56:12,312 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 274 [2019-10-01 21:56:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:12,312 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-01 21:56:12,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 21:56:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-01 21:56:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-01 21:56:12,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:12,315 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:12,315 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1113755277, now seen corresponding path program 58 times [2019-10-01 21:56:12,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:12,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:12,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:12,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 21:56:13,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:13,750 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:13,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:56:14,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:56:14,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:14,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:56:14,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 4817 trivial. 0 not checked. [2019-10-01 21:56:14,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 20] total 79 [2019-10-01 21:56:14,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 21:56:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 21:56:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=4143, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:56:14,611 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 79 states. [2019-10-01 21:56:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:14,956 INFO L93 Difference]: Finished difference Result 293 states and 305 transitions. [2019-10-01 21:56:14,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 21:56:14,956 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 282 [2019-10-01 21:56:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:14,958 INFO L225 Difference]: With dead ends: 293 [2019-10-01 21:56:14,958 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 21:56:14,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2019, Invalid=4143, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:56:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 21:56:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-10-01 21:56:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 21:56:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-01 21:56:14,965 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 282 [2019-10-01 21:56:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:14,965 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-01 21:56:14,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 21:56:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-01 21:56:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-01 21:56:14,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:14,967 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:14,967 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash 9472205, now seen corresponding path program 59 times [2019-10-01 21:56:14,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:14,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:14,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:14,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 21:56:16,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:16,387 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:16,491 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:59:42,662 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-10-01 21:59:42,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:59:42,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:59:42,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5080 trivial. 0 not checked. [2019-10-01 21:59:43,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:43,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 21] total 81 [2019-10-01 21:59:43,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 21:59:43,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 21:59:43,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2100, Invalid=4380, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:59:43,351 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 81 states. [2019-10-01 21:59:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:43,681 INFO L93 Difference]: Finished difference Result 299 states and 311 transitions. [2019-10-01 21:59:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 21:59:43,682 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 290 [2019-10-01 21:59:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:43,683 INFO L225 Difference]: With dead ends: 299 [2019-10-01 21:59:43,683 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 21:59:43,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2100, Invalid=4380, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:59:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 21:59:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-01 21:59:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-01 21:59:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-10-01 21:59:43,689 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 290 [2019-10-01 21:59:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:43,690 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-10-01 21:59:43,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 21:59:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-10-01 21:59:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-01 21:59:43,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:43,693 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:43,693 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash -800321267, now seen corresponding path program 60 times [2019-10-01 21:59:43,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:43,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:43,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7234 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 21:59:45,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:45,186 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE