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/reducercommutativity/sum40-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:42:20,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:42:20,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:42:20,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:42:20,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:42:20,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:42:20,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:42:20,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:42:20,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:42:20,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:42:20,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:42:20,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:42:20,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:42:20,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:42:20,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:42:20,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:42:20,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:42:20,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:42:20,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:42:20,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:42:20,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:42:20,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:42:20,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:42:20,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:42:20,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:42:20,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:42:20,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:42:20,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:42:20,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:42:20,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:42:20,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:42:20,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:42:20,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:42:20,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:42:20,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:42:20,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:42:20,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:42:20,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:42:20,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:42:20,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:42:20,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:42:20,184 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-02 14:42:20,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:42:20,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:42:20,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:42:20,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:42:20,201 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:42:20,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:42:20,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:42:20,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:42:20,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:42:20,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:42:20,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:42:20,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:42:20,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:42:20,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:42:20,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:42:20,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:42:20,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:42:20,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:42:20,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:42:20,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:42:20,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:42:20,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:42:20,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:42:20,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:42:20,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:42:20,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:42:20,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:42:20,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:42:20,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:42:20,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:42:20,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:42:20,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:42:20,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:42:20,252 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:42:20,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum40-2.i [2019-10-02 14:42:20,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032cb8f87/1afcacd601144c70ae91a931a18024a8/FLAG432ccaa78 [2019-10-02 14:42:20,729 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:42:20,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum40-2.i [2019-10-02 14:42:20,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032cb8f87/1afcacd601144c70ae91a931a18024a8/FLAG432ccaa78 [2019-10-02 14:42:21,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032cb8f87/1afcacd601144c70ae91a931a18024a8 [2019-10-02 14:42:21,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:42:21,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:42:21,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:42:21,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:42:21,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:42:21,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef99201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21, skipping insertion in model container [2019-10-02 14:42:21,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,127 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:42:21,144 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:42:21,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:42:21,360 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:42:21,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:42:21,418 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:42:21,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21 WrapperNode [2019-10-02 14:42:21,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:42:21,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:42:21,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:42:21,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:42:21,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (1/1) ... [2019-10-02 14:42:21,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:42:21,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:42:21,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:42:21,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:42:21,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (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-02 14:42:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:42:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:42:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-02 14:42:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:42:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:42:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:42:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-02 14:42:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:42:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:42:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:42:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:42:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:42:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:42:21,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:42:21,869 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:42:21,869 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 14:42:21,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:42:21 BoogieIcfgContainer [2019-10-02 14:42:21,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:42:21,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:42:21,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:42:21,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:42:21,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:42:21" (1/3) ... [2019-10-02 14:42:21,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5cde24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:42:21, skipping insertion in model container [2019-10-02 14:42:21,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:42:21" (2/3) ... [2019-10-02 14:42:21,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5cde24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:42:21, skipping insertion in model container [2019-10-02 14:42:21,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:42:21" (3/3) ... [2019-10-02 14:42:21,878 INFO L109 eAbstractionObserver]: Analyzing ICFG sum40-2.i [2019-10-02 14:42:21,888 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:42:21,895 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:42:21,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:42:21,938 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:42:21,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:42:21,939 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:42:21,939 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:42:21,939 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:42:21,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:42:21,940 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:42:21,940 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:42:21,940 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:42:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-02 14:42:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:42:21,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:21,965 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-02 14:42:21,968 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2019-10-02 14:42:21,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:21,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:22,120 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-02 14:42:22,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:42:22,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:42:22,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:42:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:42:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:42:22,143 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-02 14:42:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:22,169 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-02 14:42:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:42:22,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-02 14:42:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:22,180 INFO L225 Difference]: With dead ends: 54 [2019-10-02 14:42:22,180 INFO L226 Difference]: Without dead ends: 26 [2019-10-02 14:42:22,184 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-02 14:42:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-02 14:42:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-02 14:42:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-02 14:42:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-02 14:42:22,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-02 14:42:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:22,236 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-02 14:42:22,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:42:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-02 14:42:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:42:22,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:22,239 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-02 14:42:22,240 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2019-10-02 14:42:22,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:22,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:22,391 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-02 14:42:22,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:42:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:42:22,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:42:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:42:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:42:22,395 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-02 14:42:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:22,438 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-02 14:42:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:42:22,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:42:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:22,440 INFO L225 Difference]: With dead ends: 46 [2019-10-02 14:42:22,440 INFO L226 Difference]: Without dead ends: 28 [2019-10-02 14:42:22,442 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-02 14:42:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-02 14:42:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-02 14:42:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 14:42:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-02 14:42:22,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-02 14:42:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:22,461 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-02 14:42:22,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:42:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-02 14:42:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:42:22,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:22,463 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-02 14:42:22,463 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:22,464 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2019-10-02 14:42:22,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:22,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:22,557 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-02 14:42:22,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:22,558 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-02 14:42:22,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:22,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:42:22,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:42:22,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:42:22,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 14:42:22,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:42:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:42:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:42:22,685 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-02 14:42:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:22,721 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-02 14:42:22,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:42:22,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-02 14:42:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:22,727 INFO L225 Difference]: With dead ends: 46 [2019-10-02 14:42:22,728 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 14:42:22,729 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-02 14:42:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 14:42:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-02 14:42:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 14:42:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-02 14:42:22,745 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-02 14:42:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:22,746 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-02 14:42:22,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:42:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-02 14:42:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 14:42:22,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:22,750 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-02 14:42:22,750 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:22,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:22,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2019-10-02 14:42:22,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:22,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:22,880 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-02 14:42:22,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:42:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:42:22,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:42:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:42:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:42:22,882 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-02 14:42:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:22,906 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-02 14:42:22,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:42:22,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-02 14:42:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:22,908 INFO L225 Difference]: With dead ends: 43 [2019-10-02 14:42:22,908 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 14:42:22,910 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-02 14:42:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 14:42:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-02 14:42:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 14:42:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-02 14:42:22,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-02 14:42:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:22,926 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-02 14:42:22,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:42:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-02 14:42:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 14:42:22,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:22,931 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-02 14:42:22,931 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2019-10-02 14:42:22,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:22,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:22,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:23,046 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-02 14:42:23,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:23,046 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) [2019-10-02 14:42:23,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:23,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:42:23,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:23,166 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-02 14:42:23,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:23,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:42:23,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:42:23,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:42:23,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:42:23,177 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-02 14:42:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:23,211 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-02 14:42:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:42:23,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-02 14:42:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:23,214 INFO L225 Difference]: With dead ends: 52 [2019-10-02 14:42:23,214 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 14:42:23,215 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-02 14:42:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 14:42:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-02 14:42:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 14:42:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-02 14:42:23,228 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-02 14:42:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:23,228 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-02 14:42:23,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:42:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-02 14:42:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 14:42:23,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:23,230 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-02 14:42:23,232 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:23,233 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2019-10-02 14:42:23,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:23,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:23,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:23,346 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-02 14:42:23,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:23,347 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) [2019-10-02 14:42:23,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:23,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:23,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:23,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:42:23,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:23,450 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-02 14:42:23,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:23,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:42:23,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:42:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:42:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:42:23,474 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-02 14:42:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:23,514 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-02 14:42:23,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:42:23,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-02 14:42:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:23,518 INFO L225 Difference]: With dead ends: 54 [2019-10-02 14:42:23,519 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 14:42:23,519 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-02 14:42:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 14:42:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-02 14:42:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 14:42:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-02 14:42:23,533 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-02 14:42:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:23,534 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-02 14:42:23,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:42:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-02 14:42:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 14:42:23,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:23,537 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-02 14:42:23,537 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:23,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2019-10-02 14:42:23,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:23,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:23,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:23,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:23,625 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-02 14:42:23,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:23,626 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:23,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:23,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 14:42:23,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:23,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:42:23,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:23,717 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-02 14:42:23,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:23,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 14:42:23,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:42:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:42:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:42:23,723 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-02 14:42:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:23,783 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-02 14:42:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:42:23,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-02 14:42:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:23,786 INFO L225 Difference]: With dead ends: 59 [2019-10-02 14:42:23,787 INFO L226 Difference]: Without dead ends: 39 [2019-10-02 14:42:23,788 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-02 14:42:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-02 14:42:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-02 14:42:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 14:42:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-02 14:42:23,797 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-02 14:42:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:23,797 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-02 14:42:23,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:42:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-02 14:42:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:42:23,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:23,800 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-02 14:42:23,800 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2019-10-02 14:42:23,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:23,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:23,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:23,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:23,920 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-02 14:42:23,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:23,920 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-02 14:42:23,949 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-02 14:42:23,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:23,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:23,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:42:23,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:24,008 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-02 14:42:24,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:24,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 14:42:24,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:42:24,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:42:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:42:24,019 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-02 14:42:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:24,055 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-02 14:42:24,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 14:42:24,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-02 14:42:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:24,058 INFO L225 Difference]: With dead ends: 62 [2019-10-02 14:42:24,058 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 14:42:24,059 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-02 14:42:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 14:42:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-02 14:42:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 14:42:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-02 14:42:24,065 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-02 14:42:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:24,065 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-02 14:42:24,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:42:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-02 14:42:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:42:24,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:24,067 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-02 14:42:24,067 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:24,067 INFO L82 PathProgramCache]: Analyzing trace with hash -170213137, now seen corresponding path program 5 times [2019-10-02 14:42:24,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:24,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:24,153 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-02 14:42:24,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:24,153 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:24,235 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 14:42:24,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:24,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:42:24,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:24,277 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-02 14:42:24,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:24,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 14:42:24,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:42:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:42:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:42:24,285 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-02 14:42:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:24,338 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-02 14:42:24,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:42:24,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-02 14:42:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:24,339 INFO L225 Difference]: With dead ends: 67 [2019-10-02 14:42:24,339 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 14:42:24,340 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-02 14:42:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 14:42:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-02 14:42:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 14:42:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-02 14:42:24,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-02 14:42:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:24,346 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-02 14:42:24,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:42:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-02 14:42:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 14:42:24,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:24,348 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-02 14:42:24,348 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash 778875311, now seen corresponding path program 6 times [2019-10-02 14:42:24,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:24,435 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-02 14:42:24,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:24,436 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) [2019-10-02 14:42:24,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:24,510 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 14:42:24,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:24,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:42:24,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:24,547 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-02 14:42:24,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:24,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-02 14:42:24,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:42:24,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:42:24,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:42:24,556 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-02 14:42:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:24,625 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-02 14:42:24,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:42:24,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-02 14:42:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:24,627 INFO L225 Difference]: With dead ends: 73 [2019-10-02 14:42:24,627 INFO L226 Difference]: Without dead ends: 49 [2019-10-02 14:42:24,628 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-02 14:42:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-02 14:42:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-02 14:42:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 14:42:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-02 14:42:24,638 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-02 14:42:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:24,639 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-02 14:42:24,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:42:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-02 14:42:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:42:24,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:24,642 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-02 14:42:24,643 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash -122717169, now seen corresponding path program 7 times [2019-10-02 14:42:24,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:24,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:24,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:24,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:24,771 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-02 14:42:24,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:24,772 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-02 14:42:24,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:24,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:42:24,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:24,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:24,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:42:24,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:42:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:42:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:42:24,872 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-02 14:42:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:24,922 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-02 14:42:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:42:24,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-02 14:42:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:24,923 INFO L225 Difference]: With dead ends: 76 [2019-10-02 14:42:24,923 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 14:42:24,924 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-02 14:42:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 14:42:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-02 14:42:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 14:42:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-02 14:42:24,935 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-02 14:42:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:24,939 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-02 14:42:24,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:42:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-02 14:42:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 14:42:24,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:24,943 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-02 14:42:24,943 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1588760433, now seen corresponding path program 8 times [2019-10-02 14:42:24,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:24,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:25,064 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-02 14:42:25,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:25,065 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) [2019-10-02 14:42:25,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:25,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:25,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:25,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:42:25,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:25,150 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-02 14:42:25,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:25,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:42:25,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:42:25,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:42:25,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:25,161 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-02 14:42:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:25,213 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-02 14:42:25,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:42:25,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-02 14:42:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:25,215 INFO L225 Difference]: With dead ends: 78 [2019-10-02 14:42:25,215 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 14:42:25,216 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-02 14:42:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 14:42:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-02 14:42:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 14:42:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-02 14:42:25,221 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-02 14:42:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:25,222 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-02 14:42:25,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:42:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-02 14:42:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 14:42:25,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:25,223 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-02 14:42:25,223 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1346261587, now seen corresponding path program 9 times [2019-10-02 14:42:25,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:25,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:25,349 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-02 14:42:25,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:25,350 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:25,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:25,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 14:42:25,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:25,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:42:25,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:25,448 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-02 14:42:25,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:25,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 14:42:25,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:42:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:42:25,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:42:25,454 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-02 14:42:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:25,511 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-02 14:42:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:42:25,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-02 14:42:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:25,515 INFO L225 Difference]: With dead ends: 83 [2019-10-02 14:42:25,515 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 14:42:25,515 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-02 14:42:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 14:42:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-02 14:42:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 14:42:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-02 14:42:25,521 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-02 14:42:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:25,521 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-02 14:42:25,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:42:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-02 14:42:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 14:42:25,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:25,522 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-02 14:42:25,522 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2116910669, now seen corresponding path program 10 times [2019-10-02 14:42:25,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:25,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:25,669 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-02 14:42:25,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:25,670 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) [2019-10-02 14:42:25,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:25,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:25,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:25,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:42:25,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:25,793 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-02 14:42:25,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:25,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-02 14:42:25,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:42:25,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:42:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:42:25,799 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-02 14:42:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:25,870 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-02 14:42:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:42:25,872 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-02 14:42:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:25,873 INFO L225 Difference]: With dead ends: 89 [2019-10-02 14:42:25,875 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 14:42:25,875 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-02 14:42:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 14:42:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-02 14:42:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 14:42:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-02 14:42:25,885 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-02 14:42:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:25,885 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-02 14:42:25,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:42:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-02 14:42:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 14:42:25,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:25,887 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-02 14:42:25,887 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 343984243, now seen corresponding path program 11 times [2019-10-02 14:42:25,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:25,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:25,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:25,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:26,040 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-02 14:42:26,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:26,041 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-02 14:42:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:26,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 14:42:26,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:26,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:42:26,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:26,403 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-02 14:42:26,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:26,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-02 14:42:26,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:42:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:42:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:42:26,409 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-02 14:42:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:26,484 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-02 14:42:26,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:42:26,484 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-02 14:42:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:26,485 INFO L225 Difference]: With dead ends: 95 [2019-10-02 14:42:26,485 INFO L226 Difference]: Without dead ends: 65 [2019-10-02 14:42:26,486 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-02 14:42:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-02 14:42:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-02 14:42:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 14:42:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-02 14:42:26,491 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-02 14:42:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:26,492 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-02 14:42:26,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:42:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-02 14:42:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 14:42:26,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:26,493 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-02 14:42:26,493 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:26,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1658502451, now seen corresponding path program 12 times [2019-10-02 14:42:26,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:26,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:26,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:26,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:26,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:26,672 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-02 14:42:26,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:26,673 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) [2019-10-02 14:42:26,703 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:27,008 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 14:42:27,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:27,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:42:27,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:27,079 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-02 14:42:27,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:27,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-02 14:42:27,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:42:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:42:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:42:27,087 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-02 14:42:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:27,210 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-02 14:42:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:42:27,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-02 14:42:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:27,212 INFO L225 Difference]: With dead ends: 101 [2019-10-02 14:42:27,212 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 14:42:27,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:42:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 14:42:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-02 14:42:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 14:42:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-02 14:42:27,219 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-02 14:42:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:27,219 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-02 14:42:27,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:42:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-02 14:42:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 14:42:27,221 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:27,221 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-02 14:42:27,221 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368429, now seen corresponding path program 13 times [2019-10-02 14:42:27,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:27,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:27,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:27,507 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-02 14:42:27,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:27,508 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-02 14:42:27,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:27,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:42:27,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:27,628 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-02 14:42:27,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:27,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 14:42:27,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:42:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:42:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:42:27,634 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-02 14:42:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:27,691 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-02 14:42:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:42:27,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-02 14:42:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:27,692 INFO L225 Difference]: With dead ends: 104 [2019-10-02 14:42:27,692 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 14:42:27,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:42:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 14:42:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-02 14:42:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-02 14:42:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-02 14:42:27,698 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-02 14:42:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:27,698 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-02 14:42:27,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:42:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-02 14:42:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 14:42:27,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:27,700 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-02 14:42:27,700 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1574767605, now seen corresponding path program 14 times [2019-10-02 14:42:27,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:27,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:27,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:27,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:27,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:27,881 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-02 14:42:27,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:27,881 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) [2019-10-02 14:42:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:27,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:27,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:27,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:42:27,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:27,991 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-02 14:42:28,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 14:42:28,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:42:28,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:42:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:42:28,003 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-02 14:42:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:28,056 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-02 14:42:28,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:42:28,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-02 14:42:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:28,057 INFO L225 Difference]: With dead ends: 106 [2019-10-02 14:42:28,057 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 14:42:28,058 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-02 14:42:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 14:42:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-02 14:42:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 14:42:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-02 14:42:28,063 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-02 14:42:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:28,064 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-02 14:42:28,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:42:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-02 14:42:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 14:42:28,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:28,068 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-02 14:42:28,068 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash -459700265, now seen corresponding path program 15 times [2019-10-02 14:42:28,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:28,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:28,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:28,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:28,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:28,301 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-02 14:42:28,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:28,302 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-02 14:42:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:28,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 14:42:28,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:28,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:42:28,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:28,525 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-02 14:42:28,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:28,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-02 14:42:28,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:42:28,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:42:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:42:28,531 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-02 14:42:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:28,631 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-02 14:42:28,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:42:28,632 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-02 14:42:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:28,633 INFO L225 Difference]: With dead ends: 111 [2019-10-02 14:42:28,633 INFO L226 Difference]: Without dead ends: 77 [2019-10-02 14:42:28,634 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-02 14:42:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-02 14:42:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-02 14:42:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 14:42:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-02 14:42:28,638 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-02 14:42:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:28,638 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-02 14:42:28,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:42:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-02 14:42:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 14:42:28,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:28,640 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-02 14:42:28,640 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash -727614313, now seen corresponding path program 16 times [2019-10-02 14:42:28,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:28,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:28,854 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-02 14:42:28,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:28,855 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-02 14:42:28,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:28,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:28,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:28,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:42:28,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:28,959 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-02 14:42:28,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:28,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 14:42:28,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:42:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:42:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:42:28,964 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-02 14:42:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:29,035 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-02 14:42:29,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:42:29,036 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-02 14:42:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:29,037 INFO L225 Difference]: With dead ends: 114 [2019-10-02 14:42:29,037 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 14:42:29,037 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-02 14:42:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 14:42:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-02 14:42:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 14:42:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-02 14:42:29,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-02 14:42:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:29,042 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-02 14:42:29,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:42:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-02 14:42:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 14:42:29,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:29,043 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-02 14:42:29,043 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:29,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1948648953, now seen corresponding path program 17 times [2019-10-02 14:42:29,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:29,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:29,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:29,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:29,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:29,258 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-02 14:42:29,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:29,259 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-02 14:42:29,283 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:30,316 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-02 14:42:30,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:30,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:42:30,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:30,444 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-02 14:42:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-02 14:42:30,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:42:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:42:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:42:30,451 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-02 14:42:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:30,555 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-02 14:42:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:42:30,555 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-02 14:42:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:30,556 INFO L225 Difference]: With dead ends: 119 [2019-10-02 14:42:30,556 INFO L226 Difference]: Without dead ends: 83 [2019-10-02 14:42:30,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:42:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-02 14:42:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-02 14:42:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-02 14:42:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-02 14:42:30,561 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-02 14:42:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:30,561 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-02 14:42:30,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:42:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-02 14:42:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 14:42:30,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:30,563 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-02 14:42:30,563 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:30,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1322362553, now seen corresponding path program 18 times [2019-10-02 14:42:30,564 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:30,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:30,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:30,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:30,842 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-02 14:42:30,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:30,843 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-02 14:42:30,869 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:31,210 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-02 14:42:31,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:31,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:42:31,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:31,292 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-02 14:42:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:31,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-02 14:42:31,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:42:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:42:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:31,298 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-02 14:42:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:31,423 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-02 14:42:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:42:31,424 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-02 14:42:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:31,425 INFO L225 Difference]: With dead ends: 125 [2019-10-02 14:42:31,425 INFO L226 Difference]: Without dead ends: 87 [2019-10-02 14:42:31,426 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-02 14:42:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-02 14:42:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-02 14:42:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 14:42:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-02 14:42:31,430 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-02 14:42:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:31,430 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-02 14:42:31,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:42:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-02 14:42:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 14:42:31,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:31,432 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-02 14:42:31,432 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash -321357543, now seen corresponding path program 19 times [2019-10-02 14:42:31,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:31,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:31,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:31,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:31,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:31,681 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-02 14:42:31,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:31,682 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-02 14:42:31,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:31,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:42:31,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:31,814 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-02 14:42:31,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:31,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 14:42:31,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:42:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:42:31,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:42:31,819 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-02 14:42:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:31,885 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-02 14:42:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:42:31,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-02 14:42:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:31,886 INFO L225 Difference]: With dead ends: 128 [2019-10-02 14:42:31,886 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 14:42:31,887 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-02 14:42:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 14:42:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-02 14:42:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 14:42:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-02 14:42:31,892 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-02 14:42:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:31,892 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-02 14:42:31,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:42:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-02 14:42:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 14:42:31,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:31,894 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-02 14:42:31,894 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -415764741, now seen corresponding path program 20 times [2019-10-02 14:42:31,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:31,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:31,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:31,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:31,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:32,160 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-02 14:42:32,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:32,161 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-02 14:42:32,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:32,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:32,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:32,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:42:32,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:32,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:32,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 14:42:32,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:42:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:42:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:42:32,296 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-02 14:42:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:32,357 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-02 14:42:32,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:42:32,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-02 14:42:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:32,358 INFO L225 Difference]: With dead ends: 130 [2019-10-02 14:42:32,358 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 14:42:32,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:42:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 14:42:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-02 14:42:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 14:42:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-02 14:42:32,363 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-02 14:42:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:32,363 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-02 14:42:32,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:42:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-02 14:42:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 14:42:32,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:32,365 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-02 14:42:32,365 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:32,366 INFO L82 PathProgramCache]: Analyzing trace with hash -946768803, now seen corresponding path program 21 times [2019-10-02 14:42:32,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:32,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:32,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:32,653 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-02 14:42:32,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:32,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 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-02 14:42:32,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:32,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 14:42:32,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:32,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:42:32,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:32,857 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-02 14:42:32,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:32,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-02 14:42:32,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:42:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:42:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:42:32,863 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-02 14:42:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:32,975 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-02 14:42:32,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:42:32,975 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-02 14:42:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:32,976 INFO L225 Difference]: With dead ends: 135 [2019-10-02 14:42:32,976 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 14:42:32,977 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-02 14:42:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 14:42:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-02 14:42:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-02 14:42:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-02 14:42:32,983 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-02 14:42:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:32,984 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-02 14:42:32,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:42:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-02 14:42:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 14:42:32,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:32,990 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-02 14:42:32,990 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:32,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1306006595, now seen corresponding path program 22 times [2019-10-02 14:42:32,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:32,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:32,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:33,312 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-02 14:42:33,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:33,313 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-02 14:42:33,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:33,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:33,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:33,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:42:33,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:33,475 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-02 14:42:33,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:33,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 14:42:33,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:42:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:42:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:33,480 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-02 14:42:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:33,567 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-02 14:42:33,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:42:33,567 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-02 14:42:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:33,568 INFO L225 Difference]: With dead ends: 138 [2019-10-02 14:42:33,568 INFO L226 Difference]: Without dead ends: 96 [2019-10-02 14:42:33,569 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-02 14:42:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-02 14:42:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-02 14:42:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 14:42:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-02 14:42:33,573 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-02 14:42:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:33,573 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-02 14:42:33,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:42:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-02 14:42:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 14:42:33,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:33,574 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-02 14:42:33,575 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash 145514399, now seen corresponding path program 23 times [2019-10-02 14:42:33,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:33,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:33,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:33,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:33,928 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-02 14:42:33,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:33,928 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-02 14:42:33,960 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:36,372 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-02 14:42:36,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:36,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:42:36,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:36,567 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-02 14:42:36,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:36,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-02 14:42:36,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:42:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:42:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:36,580 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-02 14:42:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:36,752 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-02 14:42:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:42:36,752 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-02 14:42:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:36,753 INFO L225 Difference]: With dead ends: 143 [2019-10-02 14:42:36,753 INFO L226 Difference]: Without dead ends: 101 [2019-10-02 14:42:36,756 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-02 14:42:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-02 14:42:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-02 14:42:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 14:42:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-02 14:42:36,761 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-02 14:42:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:36,761 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-02 14:42:36,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:42:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-02 14:42:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 14:42:36,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:36,766 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-02 14:42:36,767 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1666503775, now seen corresponding path program 24 times [2019-10-02 14:42:36,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:36,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:36,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:37,108 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-02 14:42:37,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:37,108 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-02 14:42:37,143 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:37,810 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-02 14:42:37,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:37,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:42:37,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:37,979 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-02 14:42:37,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:37,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-02 14:42:37,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:42:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:42:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:37,985 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-02 14:42:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:38,094 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-02 14:42:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:42:38,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-02 14:42:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:38,095 INFO L225 Difference]: With dead ends: 149 [2019-10-02 14:42:38,096 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 14:42:38,096 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-02 14:42:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 14:42:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-02 14:42:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 14:42:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-02 14:42:38,103 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-02 14:42:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:38,103 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-02 14:42:38,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:42:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-02 14:42:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 14:42:38,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:38,106 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-02 14:42:38,106 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -702773313, now seen corresponding path program 25 times [2019-10-02 14:42:38,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:38,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:38,475 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-02 14:42:38,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:38,476 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-02 14:42:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:38,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:42:38,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:38,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 14:42:38,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:42:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:42:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:42:38,617 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-02 14:42:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:38,705 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-02 14:42:38,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:42:38,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-02 14:42:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:38,707 INFO L225 Difference]: With dead ends: 152 [2019-10-02 14:42:38,707 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 14:42:38,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:42:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 14:42:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-02 14:42:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-02 14:42:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-02 14:42:38,712 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-02 14:42:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:38,712 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-02 14:42:38,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:42:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-02 14:42:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 14:42:38,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:38,713 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-02 14:42:38,714 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1510967329, now seen corresponding path program 26 times [2019-10-02 14:42:38,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:39,231 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-02 14:42:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:39,235 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-02 14:42:39,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:39,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:39,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:39,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:42:39,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:39,426 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-02 14:42:39,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:39,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 14:42:39,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:42:39,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:42:39,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:42:39,432 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-02 14:42:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:39,523 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-02 14:42:39,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 14:42:39,523 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-02 14:42:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:39,524 INFO L225 Difference]: With dead ends: 154 [2019-10-02 14:42:39,524 INFO L226 Difference]: Without dead ends: 108 [2019-10-02 14:42:39,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:42:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-02 14:42:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-02 14:42:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-02 14:42:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-02 14:42:39,532 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-02 14:42:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:39,532 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-02 14:42:39,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:42:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-02 14:42:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:42:39,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:39,533 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-02 14:42:39,534 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1388054525, now seen corresponding path program 27 times [2019-10-02 14:42:39,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:39,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:39,926 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-02 14:42:39,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:39,926 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-02 14:42:39,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:40,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-02 14:42:40,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:40,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:42:40,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 351 proven. 49 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2019-10-02 14:42:40,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:40,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12] total 40 [2019-10-02 14:42:40,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 14:42:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 14:42:40,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1020, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:42:40,255 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 40 states. [2019-10-02 14:42:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:40,645 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2019-10-02 14:42:40,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:42:40,646 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 148 [2019-10-02 14:42:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:40,647 INFO L225 Difference]: With dead ends: 160 [2019-10-02 14:42:40,647 INFO L226 Difference]: Without dead ends: 114 [2019-10-02 14:42:40,649 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=628, Invalid=1628, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:42:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-02 14:42:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-10-02 14:42:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-02 14:42:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-10-02 14:42:40,658 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 148 [2019-10-02 14:42:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:40,658 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-10-02 14:42:40,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 14:42:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-10-02 14:42:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 14:42:40,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:40,660 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 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-02 14:42:40,660 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1448030523, now seen corresponding path program 28 times [2019-10-02 14:42:40,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:40,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-02 14:42:41,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:41,174 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-02 14:42:41,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:41,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:41,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:41,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:42:41,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2019-10-02 14:42:41,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:41,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2019-10-02 14:42:41,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:42:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:42:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:42:41,480 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2019-10-02 14:42:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:41,658 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2019-10-02 14:42:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:42:41,658 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2019-10-02 14:42:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:41,659 INFO L225 Difference]: With dead ends: 167 [2019-10-02 14:42:41,659 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 14:42:41,660 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:42:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 14:42:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-10-02 14:42:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-02 14:42:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-10-02 14:42:41,665 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2019-10-02 14:42:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:41,666 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-10-02 14:42:41,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:42:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-10-02 14:42:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 14:42:41,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:41,667 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 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-02 14:42:41,667 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 921802629, now seen corresponding path program 29 times [2019-10-02 14:42:41,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:41,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:41,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-02 14:42:42,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:42,172 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-02 14:42:42,213 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:54,670 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-02 14:42:54,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:54,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:42:54,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2019-10-02 14:42:54,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:54,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-10-02 14:42:54,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 14:42:54,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 14:42:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:42:54,874 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2019-10-02 14:42:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:55,007 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-10-02 14:42:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 14:42:55,008 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2019-10-02 14:42:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:55,009 INFO L225 Difference]: With dead ends: 173 [2019-10-02 14:42:55,009 INFO L226 Difference]: Without dead ends: 123 [2019-10-02 14:42:55,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:42:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-02 14:42:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-10-02 14:42:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-02 14:42:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-02 14:42:55,019 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2019-10-02 14:42:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:55,019 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-02 14:42:55,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 14:42:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-02 14:42:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 14:42:55,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:55,020 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 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-02 14:42:55,021 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:55,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash 301043269, now seen corresponding path program 30 times [2019-10-02 14:42:55,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:55,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:55,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:55,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:55,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-02 14:42:55,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:55,795 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-02 14:42:55,837 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:56,604 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-02 14:42:56,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:56,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:42:56,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2019-10-02 14:42:56,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 14:42:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 14:42:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:42:56,832 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2019-10-02 14:42:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:57,009 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2019-10-02 14:42:57,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 14:42:57,010 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2019-10-02 14:42:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:57,011 INFO L225 Difference]: With dead ends: 179 [2019-10-02 14:42:57,012 INFO L226 Difference]: Without dead ends: 127 [2019-10-02 14:42:57,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:42:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-02 14:42:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-10-02 14:42:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-02 14:42:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-02 14:42:57,020 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2019-10-02 14:42:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:57,021 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-02 14:42:57,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 14:42:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-02 14:42:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:42:57,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:57,023 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-02 14:42:57,023 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:57,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1172060325, now seen corresponding path program 31 times [2019-10-02 14:42:57,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:57,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:57,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:57,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:57,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:57,595 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-02 14:42:57,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:57,596 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-02 14:42:57,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:57,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:42:57,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:57,758 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-02 14:42:57,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:57,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:42:57,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:42:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:42:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:42:57,763 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-02 14:42:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:57,900 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-02 14:42:57,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:42:57,900 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-02 14:42:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:57,901 INFO L225 Difference]: With dead ends: 182 [2019-10-02 14:42:57,901 INFO L226 Difference]: Without dead ends: 128 [2019-10-02 14:42:57,902 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-02 14:42:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-02 14:42:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-02 14:42:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-02 14:42:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-02 14:42:57,907 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-02 14:42:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:57,907 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-02 14:42:57,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:42:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-02 14:42:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 14:42:57,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:57,908 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-02 14:42:57,909 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1616125561, now seen corresponding path program 32 times [2019-10-02 14:42:57,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:57,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:57,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:57,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:57,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:58,642 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-02 14:42:58,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:58,643 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-02 14:42:58,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:58,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:58,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:58,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 14:42:58,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:58,833 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-02 14:42:58,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-02 14:42:58,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 14:42:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 14:42:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:42:58,840 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2019-10-02 14:42:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:58,959 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2019-10-02 14:42:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 14:42:58,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2019-10-02 14:42:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:58,960 INFO L225 Difference]: With dead ends: 184 [2019-10-02 14:42:58,960 INFO L226 Difference]: Without dead ends: 130 [2019-10-02 14:42:58,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:42:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-02 14:42:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-10-02 14:42:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-02 14:42:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-10-02 14:42:58,966 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2019-10-02 14:42:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:58,966 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-10-02 14:42:58,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 14:42:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-10-02 14:42:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 14:42:58,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:58,968 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 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-02 14:42:58,968 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1003169303, now seen corresponding path program 33 times [2019-10-02 14:42:58,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:58,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:58,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-02 14:42:59,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:59,609 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-02 14:42:59,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:59,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-02 14:42:59,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:59,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:42:59,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 448 proven. 100 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2019-10-02 14:43:00,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:00,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-02 14:43:00,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 14:43:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 14:43:00,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:43:00,235 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2019-10-02 14:43:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:00,455 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2019-10-02 14:43:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 14:43:00,458 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2019-10-02 14:43:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:00,459 INFO L225 Difference]: With dead ends: 189 [2019-10-02 14:43:00,460 INFO L226 Difference]: Without dead ends: 135 [2019-10-02 14:43:00,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 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-02 14:43:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-02 14:43:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-10-02 14:43:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-02 14:43:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-10-02 14:43:00,466 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2019-10-02 14:43:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:00,468 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-10-02 14:43:00,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 14:43:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-10-02 14:43:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 14:43:00,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:00,470 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 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-02 14:43:00,470 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash 457593001, now seen corresponding path program 34 times [2019-10-02 14:43:00,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:00,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:00,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2019-10-02 14:43:01,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:01,086 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-02 14:43:01,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:43:01,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:43:01,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:01,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 14:43:01,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 803 proven. 121 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:43:01,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:01,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2019-10-02 14:43:01,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 14:43:01,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 14:43:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:43:01,637 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2019-10-02 14:43:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:01,861 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2019-10-02 14:43:01,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 14:43:01,863 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2019-10-02 14:43:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:01,865 INFO L225 Difference]: With dead ends: 195 [2019-10-02 14:43:01,866 INFO L226 Difference]: Without dead ends: 139 [2019-10-02 14:43:01,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:43:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-02 14:43:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-02 14:43:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-02 14:43:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-10-02 14:43:01,874 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2019-10-02 14:43:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:01,874 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-10-02 14:43:01,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 14:43:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-10-02 14:43:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 14:43:01,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:01,877 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 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-02 14:43:01,877 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:01,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1118472855, now seen corresponding path program 35 times [2019-10-02 14:43:01,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:01,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:01,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:01,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:01,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2019-10-02 14:43:02,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:02,589 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-02 14:43:02,639 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:43:36,465 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-02 14:43:36,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:36,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 14:43:36,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2019-10-02 14:43:36,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:36,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2019-10-02 14:43:36,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 14:43:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 14:43:36,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:43:36,783 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2019-10-02 14:43:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:37,006 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2019-10-02 14:43:37,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 14:43:37,007 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2019-10-02 14:43:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:37,009 INFO L225 Difference]: With dead ends: 201 [2019-10-02 14:43:37,009 INFO L226 Difference]: Without dead ends: 143 [2019-10-02 14:43:37,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:43:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-02 14:43:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-10-02 14:43:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-02 14:43:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-10-02 14:43:37,019 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2019-10-02 14:43:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:37,019 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-10-02 14:43:37,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 14:43:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-10-02 14:43:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 14:43:37,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:37,024 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 37, 37, 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-02 14:43:37,024 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash 543770665, now seen corresponding path program 36 times [2019-10-02 14:43:37,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:37,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:37,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:37,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:37,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2019-10-02 14:43:37,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:37,731 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-02 14:43:37,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:43:41,368 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-02 14:43:41,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:41,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:43:41,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 738 proven. 81 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2019-10-02 14:43:41,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:41,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 50 [2019-10-02 14:43:41,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 14:43:41,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 14:43:41,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:43:41,592 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 50 states. [2019-10-02 14:43:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:41,801 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2019-10-02 14:43:41,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 14:43:41,804 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2019-10-02 14:43:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:41,805 INFO L225 Difference]: With dead ends: 207 [2019-10-02 14:43:41,805 INFO L226 Difference]: Without dead ends: 147 [2019-10-02 14:43:41,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:43:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-02 14:43:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-02 14:43:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-02 14:43:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-02 14:43:41,820 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 202 [2019-10-02 14:43:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:41,820 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-02 14:43:41,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 14:43:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-02 14:43:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 14:43:41,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:41,822 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 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-02 14:43:41,822 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:41,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1731487351, now seen corresponding path program 37 times [2019-10-02 14:43:41,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:41,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:41,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:41,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:41,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-02 14:43:42,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:42,530 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-02 14:43:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:42,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 14:43:42,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:43:42,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:42,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-02 14:43:42,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:43:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:43:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:43:42,730 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-02 14:43:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:42,885 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-02 14:43:42,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:43:42,885 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2019-10-02 14:43:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:42,887 INFO L225 Difference]: With dead ends: 210 [2019-10-02 14:43:42,887 INFO L226 Difference]: Without dead ends: 148 [2019-10-02 14:43:42,888 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:43:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-02 14:43:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-02 14:43:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-02 14:43:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-02 14:43:42,893 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 206 [2019-10-02 14:43:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:42,893 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-02 14:43:42,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:43:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-02 14:43:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 14:43:42,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:42,895 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 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-02 14:43:42,895 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1569768853, now seen corresponding path program 38 times [2019-10-02 14:43:42,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:42,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:42,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-02 14:43:43,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:43,927 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-02 14:43:43,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:43:44,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:43:44,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:44,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 14:43:44,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-02 14:43:44,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:44,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-02 14:43:44,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 14:43:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 14:43:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:43:44,137 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 43 states. [2019-10-02 14:43:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:44,302 INFO L93 Difference]: Finished difference Result 211 states and 219 transitions. [2019-10-02 14:43:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 14:43:44,303 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2019-10-02 14:43:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:44,305 INFO L225 Difference]: With dead ends: 211 [2019-10-02 14:43:44,305 INFO L226 Difference]: Without dead ends: 149 [2019-10-02 14:43:44,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:43:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-02 14:43:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-10-02 14:43:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-02 14:43:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2019-10-02 14:43:44,313 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 208 [2019-10-02 14:43:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:44,314 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2019-10-02 14:43:44,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 14:43:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2019-10-02 14:43:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 14:43:44,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:44,316 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 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-02 14:43:44,316 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -777114931, now seen corresponding path program 39 times [2019-10-02 14:43:44,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:44,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:44,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:44,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3214 trivial. 0 not checked. [2019-10-02 14:43:44,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:44,546 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-02 14:43:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:43:44,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-02 14:43:44,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:44,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:43:44,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 738 proven. 100 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2019-10-02 14:43:44,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:44,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 14:43:44,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:43:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:43:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:43:44,992 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 14 states. [2019-10-02 14:43:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:45,027 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2019-10-02 14:43:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:43:45,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 210 [2019-10-02 14:43:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:45,031 INFO L225 Difference]: With dead ends: 189 [2019-10-02 14:43:45,031 INFO L226 Difference]: Without dead ends: 152 [2019-10-02 14:43:45,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:43:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-02 14:43:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-10-02 14:43:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 14:43:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-02 14:43:45,038 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 210 [2019-10-02 14:43:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:45,039 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-02 14:43:45,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:43:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-02 14:43:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 14:43:45,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:45,040 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-02 14:43:45,041 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1307046347, now seen corresponding path program 40 times [2019-10-02 14:43:45,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:45,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:45,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:45,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3214 trivial. 0 not checked. [2019-10-02 14:43:45,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:45,297 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-02 14:43:45,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:43:45,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:43:45,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:45,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:43:45,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2434 trivial. 0 not checked. [2019-10-02 14:43:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:45,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-10-02 14:43:45,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:43:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:43:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:43:45,707 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 28 states. [2019-10-02 14:43:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:45,800 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2019-10-02 14:43:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:43:45,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 212 [2019-10-02 14:43:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:45,801 INFO L225 Difference]: With dead ends: 220 [2019-10-02 14:43:45,801 INFO L226 Difference]: Without dead ends: 157 [2019-10-02 14:43:45,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:43:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-02 14:43:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2019-10-02 14:43:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-02 14:43:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-10-02 14:43:45,809 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 212 [2019-10-02 14:43:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:45,810 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-10-02 14:43:45,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:43:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-10-02 14:43:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 14:43:45,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:45,811 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 40, 40, 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-02 14:43:45,812 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:45,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1971059033, now seen corresponding path program 41 times [2019-10-02 14:43:45,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:45,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:45,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:45,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 424 proven. 620 refuted. 0 times theorem prover too weak. 2563 trivial. 0 not checked. [2019-10-02 14:43:46,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:46,032 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-02 14:43:46,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:45:17,153 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-10-02 14:45:17,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:17,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:45:17,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 2567 trivial. 0 not checked. [2019-10-02 14:45:17,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:17,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 14:45:17,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:45:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:45:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:45:17,237 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 18 states. [2019-10-02 14:45:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:17,290 INFO L93 Difference]: Finished difference Result 225 states and 235 transitions. [2019-10-02 14:45:17,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:45:17,291 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220 [2019-10-02 14:45:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:17,292 INFO L225 Difference]: With dead ends: 225 [2019-10-02 14:45:17,292 INFO L226 Difference]: Without dead ends: 158 [2019-10-02 14:45:17,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 220 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-02 14:45:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-02 14:45:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-10-02 14:45:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-02 14:45:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-02 14:45:17,298 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 220 [2019-10-02 14:45:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:17,298 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-02 14:45:17,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:45:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-02 14:45:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 14:45:17,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:17,300 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 40, 40, 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-02 14:45:17,300 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1996366459, now seen corresponding path program 42 times [2019-10-02 14:45:17,301 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:17,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3874 backedges. 968 proven. 225 refuted. 0 times theorem prover too weak. 2681 trivial. 0 not checked. [2019-10-02 14:45:17,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:17,549 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-02 14:45:17,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:45:21,751 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-10-02 14:45:21,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:21,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:45:21,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3874 backedges. 970 proven. 144 refuted. 0 times theorem prover too weak. 2760 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-02 14:45:22,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:22,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-10-02 14:45:22,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:45:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:45:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:45:22,004 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 31 states. [2019-10-02 14:45:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:22,094 INFO L93 Difference]: Finished difference Result 232 states and 243 transitions. [2019-10-02 14:45:22,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:45:22,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 226 [2019-10-02 14:45:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:22,096 INFO L225 Difference]: With dead ends: 232 [2019-10-02 14:45:22,096 INFO L226 Difference]: Without dead ends: 163 [2019-10-02 14:45:22,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:45:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-02 14:45:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-02 14:45:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-02 14:45:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-02 14:45:22,102 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 226 [2019-10-02 14:45:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:22,102 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-02 14:45:22,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:45:22,102 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-02 14:45:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 14:45:22,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:22,104 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 40, 40, 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-02 14:45:22,104 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 400803681, now seen corresponding path program 43 times [2019-10-02 14:45:22,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:22,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:22,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:22,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:22,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2019-10-02 14:45:22,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:22,325 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-02 14:45:22,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:45:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:22,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:45:22,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 1092 proven. 256 refuted. 0 times theorem prover too weak. 2836 trivial. 0 not checked. [2019-10-02 14:45:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:22,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-10-02 14:45:22,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:45:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:45:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:45:22,792 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 33 states. [2019-10-02 14:45:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:22,889 INFO L93 Difference]: Finished difference Result 240 states and 251 transitions. [2019-10-02 14:45:22,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 14:45:22,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 234 [2019-10-02 14:45:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:22,890 INFO L225 Difference]: With dead ends: 240 [2019-10-02 14:45:22,890 INFO L226 Difference]: Without dead ends: 167 [2019-10-02 14:45:22,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:45:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-02 14:45:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2019-10-02 14:45:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 14:45:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-02 14:45:22,896 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 234 [2019-10-02 14:45:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:22,897 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-02 14:45:22,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:45:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-02 14:45:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 14:45:22,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:22,898 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 40, 40, 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-02 14:45:22,899 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1058096067, now seen corresponding path program 44 times [2019-10-02 14:45:22,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:22,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:45:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 2993 trivial. 0 not checked. [2019-10-02 14:45:23,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:23,201 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-02 14:45:23,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:45:23,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:45:23,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:23,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:45:23,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1228 proven. 289 refuted. 0 times theorem prover too weak. 2997 trivial. 0 not checked. [2019-10-02 14:45:23,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:23,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-02 14:45:23,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:45:23,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:45:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:45:23,534 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 21 states. [2019-10-02 14:45:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:23,602 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2019-10-02 14:45:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:45:23,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 242 [2019-10-02 14:45:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:23,604 INFO L225 Difference]: With dead ends: 245 [2019-10-02 14:45:23,604 INFO L226 Difference]: Without dead ends: 168 [2019-10-02 14:45:23,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:45:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-02 14:45:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-10-02 14:45:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-02 14:45:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-02 14:45:23,614 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 242 [2019-10-02 14:45:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:23,615 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-02 14:45:23,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:45:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-02 14:45:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 14:45:23,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:23,617 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 40, 40, 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-02 14:45:23,617 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -873445221, now seen corresponding path program 45 times [2019-10-02 14:45:23,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:23,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:23,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:23,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4835 backedges. 1376 proven. 324 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2019-10-02 14:45:23,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:23,923 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-02 14:45:23,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:45:25,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-02 14:45:25,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:25,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:45:25,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4835 backedges. 1378 proven. 196 refuted. 0 times theorem prover too weak. 3261 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:45:25,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:25,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-10-02 14:45:25,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:45:25,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:45:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=915, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:45:25,333 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 36 states. [2019-10-02 14:45:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:25,469 INFO L93 Difference]: Finished difference Result 252 states and 263 transitions. [2019-10-02 14:45:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 14:45:25,470 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 248 [2019-10-02 14:45:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:25,471 INFO L225 Difference]: With dead ends: 252 [2019-10-02 14:45:25,471 INFO L226 Difference]: Without dead ends: 173 [2019-10-02 14:45:25,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=915, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:45:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-02 14:45:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-02 14:45:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-02 14:45:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-02 14:45:25,479 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 248 [2019-10-02 14:45:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:25,479 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-02 14:45:25,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:45:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-02 14:45:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 14:45:25,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:25,481 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 40, 40, 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-02 14:45:25,482 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:25,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:25,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1729555849, now seen corresponding path program 46 times [2019-10-02 14:45:25,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:25,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:25,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:25,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5203 backedges. 764 proven. 1125 refuted. 0 times theorem prover too weak. 3314 trivial. 0 not checked. [2019-10-02 14:45:25,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:25,907 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-02 14:45:25,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:45:26,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:45:26,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:45:26,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:45:26,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:45:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5203 backedges. 1524 proven. 361 refuted. 0 times theorem prover too weak. 3318 trivial. 0 not checked. [2019-10-02 14:45:26,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:45:26,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 14:45:26,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:45:26,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:45:26,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:45:26,145 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 23 states. [2019-10-02 14:45:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:45:26,211 INFO L93 Difference]: Finished difference Result 257 states and 267 transitions. [2019-10-02 14:45:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:45:26,211 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 256 [2019-10-02 14:45:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:45:26,213 INFO L225 Difference]: With dead ends: 257 [2019-10-02 14:45:26,213 INFO L226 Difference]: Without dead ends: 174 [2019-10-02 14:45:26,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 256 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-02 14:45:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-02 14:45:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-02 14:45:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-02 14:45:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-10-02 14:45:26,218 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 256 [2019-10-02 14:45:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:45:26,219 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-10-02 14:45:26,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:45:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-10-02 14:45:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 14:45:26,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:45:26,221 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 40, 40, 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-02 14:45:26,221 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:45:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:45:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1664821845, now seen corresponding path program 47 times [2019-10-02 14:45:26,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:45:26,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:45:26,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:26,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:45:26,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:45:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:45:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5560 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2019-10-02 14:45:26,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:45:26,458 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-02 14:45:26,521 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:47:27,738 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-02 14:47:27,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:27,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:47:27,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5560 backedges. 1684 proven. 400 refuted. 0 times theorem prover too weak. 3476 trivial. 0 not checked. [2019-10-02 14:47:28,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:28,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2019-10-02 14:47:28,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 14:47:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 14:47:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1077, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:47:28,178 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 39 states. [2019-10-02 14:47:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:28,371 INFO L93 Difference]: Finished difference Result 264 states and 275 transitions. [2019-10-02 14:47:28,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 14:47:28,371 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 262 [2019-10-02 14:47:28,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:28,375 INFO L225 Difference]: With dead ends: 264 [2019-10-02 14:47:28,375 INFO L226 Difference]: Without dead ends: 179 [2019-10-02 14:47:28,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=405, Invalid=1077, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:47:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-02 14:47:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-02 14:47:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-02 14:47:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-02 14:47:28,390 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 262 [2019-10-02 14:47:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:28,391 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-02 14:47:28,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 14:47:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-02 14:47:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 14:47:28,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:28,394 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 40, 40, 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-02 14:47:28,395 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1490258225, now seen corresponding path program 48 times [2019-10-02 14:47:28,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:28,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:28,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5966 backedges. 1856 proven. 441 refuted. 0 times theorem prover too weak. 3669 trivial. 0 not checked. [2019-10-02 14:47:28,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:28,841 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-02 14:47:28,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:47:40,630 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-02 14:47:40,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:40,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:47:40,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5966 backedges. 1858 proven. 256 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2019-10-02 14:47:41,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:41,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2019-10-02 14:47:41,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:47:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:47:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1194, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:47:41,037 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 41 states. [2019-10-02 14:47:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:41,208 INFO L93 Difference]: Finished difference Result 272 states and 283 transitions. [2019-10-02 14:47:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:47:41,209 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 270 [2019-10-02 14:47:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:41,211 INFO L225 Difference]: With dead ends: 272 [2019-10-02 14:47:41,211 INFO L226 Difference]: Without dead ends: 183 [2019-10-02 14:47:41,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=446, Invalid=1194, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:47:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-02 14:47:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-10-02 14:47:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-02 14:47:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-02 14:47:41,218 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 270 [2019-10-02 14:47:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:41,218 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-02 14:47:41,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:47:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-02 14:47:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 14:47:41,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:41,220 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 40, 40, 17, 17, 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-02 14:47:41,220 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:41,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1340093197, now seen corresponding path program 49 times [2019-10-02 14:47:41,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:41,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:41,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:41,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:41,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6392 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 6103 trivial. 0 not checked. [2019-10-02 14:47:41,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:41,563 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-02 14:47:41,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:47:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:41,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:47:41,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6392 backedges. 2028 proven. 484 refuted. 0 times theorem prover too weak. 3880 trivial. 0 not checked. [2019-10-02 14:47:42,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:42,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 43 [2019-10-02 14:47:42,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 14:47:42,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 14:47:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1317, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:47:42,249 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 43 states. [2019-10-02 14:47:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:42,405 INFO L93 Difference]: Finished difference Result 280 states and 291 transitions. [2019-10-02 14:47:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 14:47:42,405 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 278 [2019-10-02 14:47:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:42,406 INFO L225 Difference]: With dead ends: 280 [2019-10-02 14:47:42,406 INFO L226 Difference]: Without dead ends: 187 [2019-10-02 14:47:42,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=489, Invalid=1317, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:47:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-02 14:47:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-10-02 14:47:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-02 14:47:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-02 14:47:42,412 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 278 [2019-10-02 14:47:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:42,413 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-02 14:47:42,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 14:47:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-02 14:47:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 14:47:42,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:42,415 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 40, 40, 18, 18, 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-02 14:47:42,415 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:42,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1350572055, now seen corresponding path program 50 times [2019-10-02 14:47:42,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:42,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:42,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:47:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 1108 proven. 1637 refuted. 0 times theorem prover too weak. 4093 trivial. 0 not checked. [2019-10-02 14:47:42,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:42,805 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-02 14:47:42,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:47:43,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:47:43,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:43,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:47:43,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 2212 proven. 529 refuted. 0 times theorem prover too weak. 4097 trivial. 0 not checked. [2019-10-02 14:47:43,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:43,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-02 14:47:43,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:47:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:47:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:47:43,061 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 27 states. [2019-10-02 14:47:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:43,131 INFO L93 Difference]: Finished difference Result 285 states and 295 transitions. [2019-10-02 14:47:43,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:47:43,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 286 [2019-10-02 14:47:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:43,133 INFO L225 Difference]: With dead ends: 285 [2019-10-02 14:47:43,134 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 14:47:43,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:47:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 14:47:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-10-02 14:47:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-02 14:47:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-10-02 14:47:43,140 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 286 [2019-10-02 14:47:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:43,141 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-10-02 14:47:43,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:47:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-10-02 14:47:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 14:47:43,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:43,143 INFO L411 BasicCegarLoop]: trace histogram [72, 72, 40, 40, 18, 18, 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-02 14:47:43,143 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1722548039, now seen corresponding path program 51 times [2019-10-02 14:47:43,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:43,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:43,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:43,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:43,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2408 proven. 576 refuted. 0 times theorem prover too weak. 4283 trivial. 0 not checked. [2019-10-02 14:47:43,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:43,533 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-02 14:47:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:47:47,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-10-02 14:47:47,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:47,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 14:47:47,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2410 proven. 324 refuted. 0 times theorem prover too weak. 4533 trivial. 0 not checked. [2019-10-02 14:47:48,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:48,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 46 [2019-10-02 14:47:48,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 14:47:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 14:47:48,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=1510, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:47:48,169 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 46 states. [2019-10-02 14:47:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:48,343 INFO L93 Difference]: Finished difference Result 292 states and 303 transitions. [2019-10-02 14:47:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 14:47:48,344 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 292 [2019-10-02 14:47:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:48,345 INFO L225 Difference]: With dead ends: 292 [2019-10-02 14:47:48,345 INFO L226 Difference]: Without dead ends: 193 [2019-10-02 14:47:48,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=560, Invalid=1510, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:47:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-02 14:47:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-10-02 14:47:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-02 14:47:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-02 14:47:48,351 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 292 [2019-10-02 14:47:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:48,351 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-02 14:47:48,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 14:47:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-02 14:47:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 14:47:48,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:48,354 INFO L411 BasicCegarLoop]: trace histogram [75, 75, 40, 40, 19, 19, 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-02 14:47:48,354 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1531545891, now seen corresponding path program 52 times [2019-10-02 14:47:48,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:48,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:48,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:48,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:48,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7751 backedges. 2608 proven. 625 refuted. 0 times theorem prover too weak. 4518 trivial. 0 not checked. [2019-10-02 14:47:48,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:48,768 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-02 14:47:48,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:47:49,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:47:49,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:49,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:47:49,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7751 backedges. 2608 proven. 625 refuted. 0 times theorem prover too weak. 4518 trivial. 0 not checked. [2019-10-02 14:47:49,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 14:47:49,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:47:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:47:49,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:47:49,054 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 29 states. [2019-10-02 14:47:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:49,144 INFO L93 Difference]: Finished difference Result 297 states and 307 transitions. [2019-10-02 14:47:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:47:49,145 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 300 [2019-10-02 14:47:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:49,146 INFO L225 Difference]: With dead ends: 297 [2019-10-02 14:47:49,146 INFO L226 Difference]: Without dead ends: 194 [2019-10-02 14:47:49,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:47:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-02 14:47:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-10-02 14:47:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-02 14:47:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 197 transitions. [2019-10-02 14:47:49,152 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 197 transitions. Word has length 300 [2019-10-02 14:47:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:49,152 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 197 transitions. [2019-10-02 14:47:49,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:47:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2019-10-02 14:47:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 14:47:49,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:49,154 INFO L411 BasicCegarLoop]: trace histogram [78, 78, 40, 40, 19, 19, 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-02 14:47:49,155 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2059725825, now seen corresponding path program 53 times [2019-10-02 14:47:49,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:49,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8216 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 7855 trivial. 0 not checked. [2019-10-02 14:47:49,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:49,503 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-02 14:47:49,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:50:20,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-02 14:50:20,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:20,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:50:20,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8216 backedges. 2812 proven. 676 refuted. 0 times theorem prover too weak. 4728 trivial. 0 not checked. [2019-10-02 14:50:20,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:20,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29] total 49 [2019-10-02 14:50:20,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 14:50:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 14:50:20,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=1716, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:50:20,745 INFO L87 Difference]: Start difference. First operand 193 states and 197 transitions. Second operand 49 states. [2019-10-02 14:50:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:20,932 INFO L93 Difference]: Finished difference Result 304 states and 315 transitions. [2019-10-02 14:50:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 14:50:20,933 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 306 [2019-10-02 14:50:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:20,934 INFO L225 Difference]: With dead ends: 304 [2019-10-02 14:50:20,935 INFO L226 Difference]: Without dead ends: 199 [2019-10-02 14:50:20,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=636, Invalid=1716, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:50:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-02 14:50:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-10-02 14:50:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-02 14:50:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2019-10-02 14:50:20,941 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 306 [2019-10-02 14:50:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:20,942 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2019-10-02 14:50:20,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 14:50:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2019-10-02 14:50:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 14:50:20,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:20,944 INFO L411 BasicCegarLoop]: trace histogram [81, 81, 40, 40, 20, 20, 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-02 14:50:20,944 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:20,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1844311331, now seen corresponding path program 54 times [2019-10-02 14:50:20,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:20,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:20,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8738 backedges. 1516 proven. 2245 refuted. 0 times theorem prover too weak. 4977 trivial. 0 not checked. [2019-10-02 14:50:21,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:21,437 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-02 14:50:21,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:50:29,036 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-02 14:50:29,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:29,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:50:29,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8738 backedges. 3034 proven. 400 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-10-02 14:50:29,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:29,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 51 [2019-10-02 14:50:29,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:50:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:50:29,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=1863, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:50:29,543 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 51 states. [2019-10-02 14:50:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:29,753 INFO L93 Difference]: Finished difference Result 312 states and 323 transitions. [2019-10-02 14:50:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 14:50:29,754 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 314 [2019-10-02 14:50:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:29,755 INFO L225 Difference]: With dead ends: 312 [2019-10-02 14:50:29,755 INFO L226 Difference]: Without dead ends: 203 [2019-10-02 14:50:29,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=687, Invalid=1863, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:50:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-02 14:50:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-10-02 14:50:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-02 14:50:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-02 14:50:29,764 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 314 [2019-10-02 14:50:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:29,764 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-02 14:50:29,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:50:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-02 14:50:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 14:50:29,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:29,766 INFO L411 BasicCegarLoop]: trace histogram [84, 84, 40, 40, 21, 21, 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-02 14:50:29,767 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1891797831, now seen corresponding path program 55 times [2019-10-02 14:50:29,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:29,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:29,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:29,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9280 backedges. 3256 proven. 784 refuted. 0 times theorem prover too weak. 5240 trivial. 0 not checked. [2019-10-02 14:50:30,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:30,362 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-02 14:50:30,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:30,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 14:50:30,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9280 backedges. 3252 proven. 784 refuted. 0 times theorem prover too weak. 5244 trivial. 0 not checked. [2019-10-02 14:50:30,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:30,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-02 14:50:30,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:50:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:50:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:50:30,662 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 32 states. [2019-10-02 14:50:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:30,783 INFO L93 Difference]: Finished difference Result 317 states and 327 transitions. [2019-10-02 14:50:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:50:30,783 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 322 [2019-10-02 14:50:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:30,785 INFO L225 Difference]: With dead ends: 317 [2019-10-02 14:50:30,785 INFO L226 Difference]: Without dead ends: 204 [2019-10-02 14:50:30,785 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:50:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-02 14:50:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-02 14:50:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-02 14:50:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-02 14:50:30,791 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 322 [2019-10-02 14:50:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:30,791 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-02 14:50:30,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:50:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-02 14:50:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 14:50:30,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:30,794 INFO L411 BasicCegarLoop]: trace histogram [87, 87, 40, 40, 21, 21, 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-02 14:50:30,794 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:30,795 INFO L82 PathProgramCache]: Analyzing trace with hash 124980503, now seen corresponding path program 56 times [2019-10-02 14:50:30,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:30,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:30,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9799 backedges. 1744 proven. 2585 refuted. 0 times theorem prover too weak. 5470 trivial. 0 not checked. [2019-10-02 14:50:31,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:31,670 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-02 14:50:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:50:31,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:50:31,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:31,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 14:50:31,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9799 backedges. 3484 proven. 841 refuted. 0 times theorem prover too weak. 5474 trivial. 0 not checked. [2019-10-02 14:50:32,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:32,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-02 14:50:32,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:50:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:50:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:50:32,071 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 33 states. [2019-10-02 14:50:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:32,169 INFO L93 Difference]: Finished difference Result 321 states and 331 transitions. [2019-10-02 14:50:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:50:32,169 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 328 [2019-10-02 14:50:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:32,170 INFO L225 Difference]: With dead ends: 321 [2019-10-02 14:50:32,171 INFO L226 Difference]: Without dead ends: 206 [2019-10-02 14:50:32,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:50:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-02 14:50:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-10-02 14:50:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-02 14:50:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-02 14:50:32,181 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 328 [2019-10-02 14:50:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:32,181 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-02 14:50:32,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:50:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-02 14:50:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 14:50:32,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:32,184 INFO L411 BasicCegarLoop]: trace histogram [90, 90, 40, 40, 21, 21, 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-02 14:50:32,186 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:32,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1450400011, now seen corresponding path program 57 times [2019-10-02 14:50:32,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:32,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:32,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 3728 proven. 900 refuted. 0 times theorem prover too weak. 5708 trivial. 0 not checked. [2019-10-02 14:50:32,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:32,933 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-02 14:50:33,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:50:36,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-10-02 14:50:36,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:36,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:50:36,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 3730 proven. 441 refuted. 0 times theorem prover too weak. 6165 trivial. 0 not checked. [2019-10-02 14:50:36,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:36,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 24] total 55 [2019-10-02 14:50:36,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 14:50:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 14:50:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=2167, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 14:50:36,579 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 55 states. [2019-10-02 14:50:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:36,817 INFO L93 Difference]: Finished difference Result 328 states and 339 transitions. [2019-10-02 14:50:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 14:50:36,817 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 334 [2019-10-02 14:50:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:36,819 INFO L225 Difference]: With dead ends: 328 [2019-10-02 14:50:36,820 INFO L226 Difference]: Without dead ends: 211 [2019-10-02 14:50:36,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=803, Invalid=2167, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 14:50:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-02 14:50:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-10-02 14:50:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-02 14:50:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-02 14:50:36,826 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 334 [2019-10-02 14:50:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:36,826 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-02 14:50:36,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 14:50:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-02 14:50:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 14:50:36,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:36,829 INFO L411 BasicCegarLoop]: trace histogram [93, 93, 40, 40, 22, 22, 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-02 14:50:36,829 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash -963760175, now seen corresponding path program 58 times [2019-10-02 14:50:36,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:36,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:36,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10934 backedges. 3976 proven. 961 refuted. 0 times theorem prover too weak. 5997 trivial. 0 not checked. [2019-10-02 14:50:37,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:37,459 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-02 14:50:37,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:50:37,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:50:37,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:37,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:50:37,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10934 backedges. 3976 proven. 961 refuted. 0 times theorem prover too weak. 5997 trivial. 0 not checked. [2019-10-02 14:50:37,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:37,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-02 14:50:37,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 14:50:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 14:50:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:50:37,790 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 35 states. [2019-10-02 14:50:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:37,902 INFO L93 Difference]: Finished difference Result 333 states and 343 transitions. [2019-10-02 14:50:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:50:37,906 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 342 [2019-10-02 14:50:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:37,908 INFO L225 Difference]: With dead ends: 333 [2019-10-02 14:50:37,908 INFO L226 Difference]: Without dead ends: 212 [2019-10-02 14:50:37,908 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:50:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-02 14:50:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-10-02 14:50:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-02 14:50:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2019-10-02 14:50:37,914 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 342 [2019-10-02 14:50:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:37,914 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2019-10-02 14:50:37,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 14:50:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2019-10-02 14:50:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-10-02 14:50:37,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:37,917 INFO L411 BasicCegarLoop]: trace histogram [96, 96, 40, 40, 22, 22, 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-02 14:50:37,917 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:37,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash 711374127, now seen corresponding path program 59 times [2019-10-02 14:50:37,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:37,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:37,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:37,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:37,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11507 backedges. 4232 proven. 1024 refuted. 0 times theorem prover too weak. 6251 trivial. 0 not checked. [2019-10-02 14:50:38,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:38,669 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-02 14:50:38,753 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:53:42,303 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-10-02 14:53:42,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:53:42,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:53:42,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:53:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11507 backedges. 4228 proven. 1024 refuted. 0 times theorem prover too weak. 6255 trivial. 0 not checked. [2019-10-02 14:53:42,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:53:42,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:53:42,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:53:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:53:42,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:53:42,495 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 36 states. [2019-10-02 14:53:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:53:42,610 INFO L93 Difference]: Finished difference Result 337 states and 347 transitions. [2019-10-02 14:53:42,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:53:42,611 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 348 [2019-10-02 14:53:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:53:42,612 INFO L225 Difference]: With dead ends: 337 [2019-10-02 14:53:42,612 INFO L226 Difference]: Without dead ends: 214 [2019-10-02 14:53:42,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:53:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-02 14:53:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-10-02 14:53:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-02 14:53:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-10-02 14:53:42,618 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 348 [2019-10-02 14:53:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:53:42,618 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-10-02 14:53:42,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:53:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-10-02 14:53:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-10-02 14:53:42,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:53:42,621 INFO L411 BasicCegarLoop]: trace histogram [99, 99, 40, 40, 22, 22, 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-02 14:53:42,622 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:53:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:53:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1766849549, now seen corresponding path program 60 times [2019-10-02 14:53:42,622 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:53:42,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:53:42,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:42,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:53:42,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12098 backedges. 2248 proven. 3337 refuted. 0 times theorem prover too weak. 6513 trivial. 0 not checked. [2019-10-02 14:53:43,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:53:43,279 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-02 14:53:43,366 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:53:47,278 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-10-02 14:53:47,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:53:47,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:53:47,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:53:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12098 backedges. 4498 proven. 484 refuted. 0 times theorem prover too weak. 7116 trivial. 0 not checked. [2019-10-02 14:53:47,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:53:47,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 25] total 59 [2019-10-02 14:53:47,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 14:53:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 14:53:47,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:53:47,870 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 59 states. [2019-10-02 14:53:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:53:48,113 INFO L93 Difference]: Finished difference Result 344 states and 355 transitions. [2019-10-02 14:53:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 14:53:48,115 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 354 [2019-10-02 14:53:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:53:48,116 INFO L225 Difference]: With dead ends: 344 [2019-10-02 14:53:48,117 INFO L226 Difference]: Without dead ends: 219 [2019-10-02 14:53:48,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:53:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-02 14:53:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-10-02 14:53:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-02 14:53:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2019-10-02 14:53:48,124 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 354 [2019-10-02 14:53:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:53:48,124 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2019-10-02 14:53:48,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 14:53:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2019-10-02 14:53:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 14:53:48,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:53:48,127 INFO L411 BasicCegarLoop]: trace histogram [102, 102, 40, 40, 23, 23, 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-02 14:53:48,127 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:53:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:53:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1759798249, now seen corresponding path program 61 times [2019-10-02 14:53:48,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:53:48,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:53:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:48,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:53:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12752 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 12223 trivial. 0 not checked. [2019-10-02 14:53:48,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:53:48,703 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:53:48,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:53:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:48,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 14:53:48,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:53:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12752 backedges. 4764 proven. 1156 refuted. 0 times theorem prover too weak. 6832 trivial. 0 not checked. [2019-10-02 14:53:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:53:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37] total 61 [2019-10-02 14:53:49,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-02 14:53:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-02 14:53:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=2670, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 14:53:49,883 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand 61 states. [2019-10-02 14:53:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:53:50,112 INFO L93 Difference]: Finished difference Result 352 states and 363 transitions. [2019-10-02 14:53:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 14:53:50,113 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 362 [2019-10-02 14:53:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:53:50,114 INFO L225 Difference]: With dead ends: 352 [2019-10-02 14:53:50,115 INFO L226 Difference]: Without dead ends: 223 [2019-10-02 14:53:50,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=2670, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 14:53:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-10-02 14:53:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-10-02 14:53:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-02 14:53:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-02 14:53:50,123 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 362 [2019-10-02 14:53:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:53:50,123 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-02 14:53:50,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-02 14:53:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-02 14:53:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-02 14:53:50,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:53:50,126 INFO L411 BasicCegarLoop]: trace histogram [105, 105, 40, 40, 24, 24, 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-02 14:53:50,126 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:53:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:53:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -534686011, now seen corresponding path program 62 times [2019-10-02 14:53:50,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:53:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:53:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:50,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:53:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 13426 backedges. 2524 proven. 3749 refuted. 0 times theorem prover too weak. 7153 trivial. 0 not checked. [2019-10-02 14:53:51,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:53:51,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:53:51,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:53:51,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:53:51,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:53:51,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:53:51,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:53:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13426 backedges. 5044 proven. 1225 refuted. 0 times theorem prover too weak. 7157 trivial. 0 not checked. [2019-10-02 14:53:51,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:53:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-02 14:53:51,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 14:53:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 14:53:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:53:51,401 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 39 states. [2019-10-02 14:53:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:53:51,511 INFO L93 Difference]: Finished difference Result 357 states and 367 transitions. [2019-10-02 14:53:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:53:51,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 370 [2019-10-02 14:53:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:53:51,513 INFO L225 Difference]: With dead ends: 357 [2019-10-02 14:53:51,513 INFO L226 Difference]: Without dead ends: 224 [2019-10-02 14:53:51,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:53:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-02 14:53:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-02 14:53:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-02 14:53:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-02 14:53:51,520 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 370 [2019-10-02 14:53:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:53:51,520 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-02 14:53:51,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 14:53:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-02 14:53:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-02 14:53:51,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:53:51,523 INFO L411 BasicCegarLoop]: trace histogram [108, 108, 40, 40, 24, 24, 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-02 14:53:51,523 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:53:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:53:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -68201693, now seen corresponding path program 63 times [2019-10-02 14:53:51,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:53:51,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:53:51,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:51,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:53:51,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14071 backedges. 5336 proven. 1296 refuted. 0 times theorem prover too weak. 7439 trivial. 0 not checked. [2019-10-02 14:53:52,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:53:52,234 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:53:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:54:10,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-10-02 14:54:10,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:54:10,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:54:10,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14071 backedges. 5338 proven. 576 refuted. 0 times theorem prover too weak. 8157 trivial. 0 not checked. [2019-10-02 14:54:11,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:11,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 27] total 64 [2019-10-02 14:54:11,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-02 14:54:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-02 14:54:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=2941, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 14:54:11,099 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 64 states. [2019-10-02 14:54:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:11,376 INFO L93 Difference]: Finished difference Result 364 states and 375 transitions. [2019-10-02 14:54:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 14:54:11,377 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 376 [2019-10-02 14:54:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:11,379 INFO L225 Difference]: With dead ends: 364 [2019-10-02 14:54:11,379 INFO L226 Difference]: Without dead ends: 229 [2019-10-02 14:54:11,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1091, Invalid=2941, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 14:54:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-02 14:54:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-10-02 14:54:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-02 14:54:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2019-10-02 14:54:11,385 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 376 [2019-10-02 14:54:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:11,385 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2019-10-02 14:54:11,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-02 14:54:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2019-10-02 14:54:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-10-02 14:54:11,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:11,388 INFO L411 BasicCegarLoop]: trace histogram [111, 111, 40, 40, 25, 25, 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-02 14:54:11,388 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1870357761, now seen corresponding path program 64 times [2019-10-02 14:54:11,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:11,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:11,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:54:11,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14783 backedges. 2816 proven. 4185 refuted. 0 times theorem prover too weak. 7782 trivial. 0 not checked. [2019-10-02 14:54:12,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:12,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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:12,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:54:12,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:54:12,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:54:12,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 14:54:12,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:54:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14783 backedges. 5628 proven. 1369 refuted. 0 times theorem prover too weak. 7786 trivial. 0 not checked. [2019-10-02 14:54:12,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:54:12,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-02 14:54:12,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:54:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:54:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:54:12,517 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 41 states. [2019-10-02 14:54:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:12,619 INFO L93 Difference]: Finished difference Result 369 states and 379 transitions. [2019-10-02 14:54:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:54:12,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 384 [2019-10-02 14:54:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:12,621 INFO L225 Difference]: With dead ends: 369 [2019-10-02 14:54:12,621 INFO L226 Difference]: Without dead ends: 230 [2019-10-02 14:54:12,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:54:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-02 14:54:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-10-02 14:54:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-02 14:54:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-02 14:54:12,627 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 384 [2019-10-02 14:54:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:12,627 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-02 14:54:12,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:54:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-02 14:54:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 14:54:12,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:12,630 INFO L411 BasicCegarLoop]: trace histogram [114, 114, 40, 40, 25, 25, 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-02 14:54:12,630 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1039737565, now seen corresponding path program 65 times [2019-10-02 14:54:12,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:12,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:12,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:12,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:54:12,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15464 backedges. 2968 proven. 4412 refuted. 0 times theorem prover too weak. 8084 trivial. 0 not checked. [2019-10-02 14:54:13,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:54:13,382 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:54:13,478 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1