java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy9_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:56:32,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:56:32,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:56:32,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:56:32,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:56:32,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:56:32,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:56:32,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:56:32,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:56:32,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:56:32,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:56:32,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:56:32,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:56:32,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:56:32,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:56:32,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:56:32,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:56:32,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:56:32,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:56:32,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:56:32,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:56:32,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:56:32,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:56:32,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:56:32,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:56:32,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:56:32,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:56:32,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:56:32,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:56:32,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:56:32,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:56:32,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:56:32,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:56:32,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:56:32,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:56:32,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:56:32,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:56:32,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:56:32,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:56:32,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:56:32,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:56:32,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:56:32,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:56:32,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:56:32,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:56:32,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:56:32,978 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:56:32,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:56:32,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:56:32,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:56:32,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:56:32,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:56:32,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:56:32,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:56:32,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:56:32,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:56:32,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:56:32,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:56:32,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:56:32,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:56:32,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:56:32,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:56:32,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:56:32,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:56:32,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:56:32,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:56:32,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:56:32,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:56:32,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:56:32,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:56:32,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:56:33,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:56:33,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:56:33,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:56:33,057 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:56:33,057 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:56:33,058 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_ground-1.i [2019-10-01 22:56:33,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cca9c59/0180df8e60464d5c8c2233dff6bcd65c/FLAGb62973f50 [2019-10-01 22:56:33,611 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:56:33,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_ground-1.i [2019-10-01 22:56:33,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cca9c59/0180df8e60464d5c8c2233dff6bcd65c/FLAGb62973f50 [2019-10-01 22:56:33,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cca9c59/0180df8e60464d5c8c2233dff6bcd65c [2019-10-01 22:56:33,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:56:33,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:56:33,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:56:33,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:56:33,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:56:33,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:56:33" (1/1) ... [2019-10-01 22:56:33,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6617fe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:33, skipping insertion in model container [2019-10-01 22:56:33,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:56:33" (1/1) ... [2019-10-01 22:56:33,955 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:56:33,981 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:56:34,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:56:34,242 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:56:34,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:56:34,404 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:56:34,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34 WrapperNode [2019-10-01 22:56:34,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:56:34,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:56:34,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:56:34,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:56:34,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... [2019-10-01 22:56:34,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... [2019-10-01 22:56:34,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... [2019-10-01 22:56:34,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... [2019-10-01 22:56:34,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... [2019-10-01 22:56:34,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... [2019-10-01 22:56:34,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... [2019-10-01 22:56:34,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:56:34,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:56:34,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:56:34,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:56:34,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:56:34,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:56:34,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:56:34,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:56:34,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:56:34,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:56:34,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:56:34,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:56:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:56:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:56:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:56:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:56:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:56:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:56:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:56:35,046 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:56:35,048 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-01 22:56:35,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:56:35 BoogieIcfgContainer [2019-10-01 22:56:35,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:56:35,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:56:35,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:56:35,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:56:35,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:56:33" (1/3) ... [2019-10-01 22:56:35,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8b16ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:56:35, skipping insertion in model container [2019-10-01 22:56:35,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:34" (2/3) ... [2019-10-01 22:56:35,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8b16ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:56:35, skipping insertion in model container [2019-10-01 22:56:35,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:56:35" (3/3) ... [2019-10-01 22:56:35,059 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy9_ground-1.i [2019-10-01 22:56:35,070 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:56:35,079 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:56:35,097 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:56:35,124 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:56:35,125 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:56:35,125 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:56:35,125 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:56:35,126 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:56:35,126 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:56:35,126 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:56:35,126 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:56:35,126 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:56:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-10-01 22:56:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:56:35,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:35,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:35,154 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash -178932642, now seen corresponding path program 1 times [2019-10-01 22:56:35,160 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:35,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:35,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:56:35,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:56:35,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:56:35,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:56:35,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:56:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:56:35,357 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2019-10-01 22:56:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:35,390 INFO L93 Difference]: Finished difference Result 94 states and 137 transitions. [2019-10-01 22:56:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:56:35,392 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-10-01 22:56:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:35,403 INFO L225 Difference]: With dead ends: 94 [2019-10-01 22:56:35,403 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:56:35,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:56:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:56:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-01 22:56:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 22:56:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-10-01 22:56:35,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 31 [2019-10-01 22:56:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:35,463 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-10-01 22:56:35,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:56:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-10-01 22:56:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:56:35,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:35,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:35,466 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1311438022, now seen corresponding path program 1 times [2019-10-01 22:56:35,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:35,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:35,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:56:35,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:56:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:56:35,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:56:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:56:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:56:35,579 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2019-10-01 22:56:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:35,637 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2019-10-01 22:56:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:56:35,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-01 22:56:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:35,645 INFO L225 Difference]: With dead ends: 86 [2019-10-01 22:56:35,646 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:56:35,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:56:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:56:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-10-01 22:56:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:56:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-10-01 22:56:35,662 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 31 [2019-10-01 22:56:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:35,663 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-10-01 22:56:35,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:56:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-10-01 22:56:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:56:35,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:35,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:35,669 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash -953933084, now seen corresponding path program 1 times [2019-10-01 22:56:35,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:35,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:35,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:35,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:35,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:56:35,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:56:35,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:56:35,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:56:35,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:56:35,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:56:35,794 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 3 states. [2019-10-01 22:56:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:35,985 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2019-10-01 22:56:35,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:56:35,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-01 22:56:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:35,989 INFO L225 Difference]: With dead ends: 100 [2019-10-01 22:56:35,989 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 22:56:35,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:56:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 22:56:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-10-01 22:56:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 22:56:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-10-01 22:56:36,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 33 [2019-10-01 22:56:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:36,001 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-10-01 22:56:36,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:56:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-10-01 22:56:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 22:56:36,003 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:36,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:36,004 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:36,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:36,005 INFO L82 PathProgramCache]: Analyzing trace with hash -753251022, now seen corresponding path program 1 times [2019-10-01 22:56:36,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:36,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:36,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:56:36,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:36,139 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:36,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:36,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:56:36,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:56:36,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:36,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-01 22:56:36,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:56:36,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:56:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:56:36,337 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 6 states. [2019-10-01 22:56:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:36,578 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2019-10-01 22:56:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:56:36,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-01 22:56:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:36,585 INFO L225 Difference]: With dead ends: 133 [2019-10-01 22:56:36,585 INFO L226 Difference]: Without dead ends: 86 [2019-10-01 22:56:36,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:56:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-01 22:56:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-10-01 22:56:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-01 22:56:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-10-01 22:56:36,597 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 51 [2019-10-01 22:56:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:36,598 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-10-01 22:56:36,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:56:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-10-01 22:56:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 22:56:36,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:36,600 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:36,601 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash 573040542, now seen corresponding path program 2 times [2019-10-01 22:56:36,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:36,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:36,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:56:36,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:36,781 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:36,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:56:36,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:56:36,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:36,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:56:36,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:56:36,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:36,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-01 22:56:36,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:56:36,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:56:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:56:36,912 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 8 states. [2019-10-01 22:56:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:37,170 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2019-10-01 22:56:37,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:56:37,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-10-01 22:56:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:37,174 INFO L225 Difference]: With dead ends: 171 [2019-10-01 22:56:37,174 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 22:56:37,175 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:56:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 22:56:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2019-10-01 22:56:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-01 22:56:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-10-01 22:56:37,186 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 71 [2019-10-01 22:56:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:37,187 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-10-01 22:56:37,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:56:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-10-01 22:56:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 22:56:37,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:37,189 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:37,190 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash -134036470, now seen corresponding path program 3 times [2019-10-01 22:56:37,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:37,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:37,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:37,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:37,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:56:37,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:37,329 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-01 22:56:37,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:37,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:56:37,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:37,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:56:37,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:56:37,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:37,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:56:37,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:56:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:56:37,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:56:37,825 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 7 states. [2019-10-01 22:56:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:38,046 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2019-10-01 22:56:38,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:56:38,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-10-01 22:56:38,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:38,048 INFO L225 Difference]: With dead ends: 198 [2019-10-01 22:56:38,049 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 22:56:38,050 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:56:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 22:56:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2019-10-01 22:56:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 22:56:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-10-01 22:56:38,078 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 91 [2019-10-01 22:56:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:38,079 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-10-01 22:56:38,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:56:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-10-01 22:56:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-01 22:56:38,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:38,082 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:38,082 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1714335960, now seen corresponding path program 4 times [2019-10-01 22:56:38,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:38,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:38,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 22:56:38,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:38,307 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-01 22:56:38,331 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:56:38,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:56:38,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:38,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:56:38,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:56:38,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-01 22:56:38,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:56:38,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:56:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:56:38,492 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 11 states. [2019-10-01 22:56:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:38,843 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2019-10-01 22:56:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:56:38,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 109 [2019-10-01 22:56:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:38,845 INFO L225 Difference]: With dead ends: 245 [2019-10-01 22:56:38,845 INFO L226 Difference]: Without dead ends: 144 [2019-10-01 22:56:38,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:56:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-01 22:56:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2019-10-01 22:56:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-01 22:56:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2019-10-01 22:56:38,859 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 109 [2019-10-01 22:56:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:38,860 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2019-10-01 22:56:38,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:56:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2019-10-01 22:56:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-01 22:56:38,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:38,864 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:38,865 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:38,865 INFO L82 PathProgramCache]: Analyzing trace with hash 734792772, now seen corresponding path program 5 times [2019-10-01 22:56:38,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:38,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:38,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:38,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-10-01 22:56:39,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:39,202 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:39,231 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:27,652 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:57:27,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:27,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:57:27,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-10-01 22:57:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:27,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:57:27,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:57:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:57:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:27,768 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 9 states. [2019-10-01 22:57:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:28,006 INFO L93 Difference]: Finished difference Result 268 states and 295 transitions. [2019-10-01 22:57:28,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:57:28,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-10-01 22:57:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:28,009 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:57:28,009 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 22:57:28,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 22:57:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-10-01 22:57:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-01 22:57:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2019-10-01 22:57:28,020 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 129 [2019-10-01 22:57:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:28,021 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2019-10-01 22:57:28,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:57:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2019-10-01 22:57:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 22:57:28,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:28,024 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:28,024 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -928964974, now seen corresponding path program 6 times [2019-10-01 22:57:28,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:28,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-10-01 22:57:28,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:28,251 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-01 22:57:28,293 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:57:49,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:57:49,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:49,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:57:49,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-10-01 22:57:49,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:49,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:57:49,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:57:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:57:49,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:49,681 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 10 states. [2019-10-01 22:57:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:49,963 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2019-10-01 22:57:49,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:57:49,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2019-10-01 22:57:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:49,965 INFO L225 Difference]: With dead ends: 302 [2019-10-01 22:57:49,965 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 22:57:49,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 22:57:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2019-10-01 22:57:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-01 22:57:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2019-10-01 22:57:49,986 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 147 [2019-10-01 22:57:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:49,987 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2019-10-01 22:57:49,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:57:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2019-10-01 22:57:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-01 22:57:49,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:49,995 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:49,995 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1192229216, now seen corresponding path program 7 times [2019-10-01 22:57:49,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:49,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:49,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:49,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-01 22:57:50,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:50,233 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:50,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:50,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:57:50,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-01 22:57:50,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:50,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-10-01 22:57:50,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:57:50,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:57:50,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:50,463 INFO L87 Difference]: Start difference. First operand 170 states and 180 transitions. Second operand 15 states. [2019-10-01 22:57:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:50,897 INFO L93 Difference]: Finished difference Result 355 states and 384 transitions. [2019-10-01 22:57:50,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:57:50,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 165 [2019-10-01 22:57:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:50,899 INFO L225 Difference]: With dead ends: 355 [2019-10-01 22:57:50,899 INFO L226 Difference]: Without dead ends: 200 [2019-10-01 22:57:50,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-01 22:57:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2019-10-01 22:57:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-01 22:57:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2019-10-01 22:57:50,908 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 165 [2019-10-01 22:57:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:50,911 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 200 transitions. [2019-10-01 22:57:50,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:57:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2019-10-01 22:57:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-01 22:57:50,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:50,914 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:50,914 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1131401420, now seen corresponding path program 8 times [2019-10-01 22:57:50,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:50,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:50,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-10-01 22:57:51,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:51,178 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:51,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:51,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:51,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:51,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:57:51,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:57:51,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:51,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-10-01 22:57:51,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:57:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:57:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:57:51,484 INFO L87 Difference]: Start difference. First operand 190 states and 200 transitions. Second operand 17 states. [2019-10-01 22:57:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:51,908 INFO L93 Difference]: Finished difference Result 393 states and 422 transitions. [2019-10-01 22:57:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:57:51,908 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 185 [2019-10-01 22:57:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:51,910 INFO L225 Difference]: With dead ends: 393 [2019-10-01 22:57:51,910 INFO L226 Difference]: Without dead ends: 220 [2019-10-01 22:57:51,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:57:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-01 22:57:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2019-10-01 22:57:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-01 22:57:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 220 transitions. [2019-10-01 22:57:51,920 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 220 transitions. Word has length 185 [2019-10-01 22:57:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:51,920 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 220 transitions. [2019-10-01 22:57:51,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:57:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 220 transitions. [2019-10-01 22:57:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-01 22:57:51,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:51,923 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:51,924 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 628386360, now seen corresponding path program 9 times [2019-10-01 22:57:51,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:51,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:51,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:51,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-01 22:57:52,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:52,111 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-01 22:57:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:10,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:58:10,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:10,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:58:10,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-10-01 22:58:10,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:10,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-01 22:58:10,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:58:10,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:58:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:58:10,982 INFO L87 Difference]: Start difference. First operand 210 states and 220 transitions. Second operand 19 states. [2019-10-01 22:58:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:11,451 INFO L93 Difference]: Finished difference Result 431 states and 460 transitions. [2019-10-01 22:58:11,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:58:11,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 205 [2019-10-01 22:58:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:11,453 INFO L225 Difference]: With dead ends: 431 [2019-10-01 22:58:11,454 INFO L226 Difference]: Without dead ends: 240 [2019-10-01 22:58:11,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:58:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-01 22:58:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 230. [2019-10-01 22:58:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-01 22:58:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 240 transitions. [2019-10-01 22:58:11,463 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 240 transitions. Word has length 205 [2019-10-01 22:58:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:11,464 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 240 transitions. [2019-10-01 22:58:11,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:58:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 240 transitions. [2019-10-01 22:58:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-01 22:58:11,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:11,467 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:11,467 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash 42780068, now seen corresponding path program 10 times [2019-10-01 22:58:11,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:11,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:11,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2019-10-01 22:58:11,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:11,726 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-01 22:58:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:58:11,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:58:11,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:11,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:58:11,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-10-01 22:58:12,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:12,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-10-01 22:58:12,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:58:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:58:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:12,094 INFO L87 Difference]: Start difference. First operand 230 states and 240 transitions. Second operand 21 states. [2019-10-01 22:58:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:12,640 INFO L93 Difference]: Finished difference Result 469 states and 498 transitions. [2019-10-01 22:58:12,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:58:12,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 225 [2019-10-01 22:58:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:12,643 INFO L225 Difference]: With dead ends: 469 [2019-10-01 22:58:12,643 INFO L226 Difference]: Without dead ends: 260 [2019-10-01 22:58:12,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-01 22:58:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2019-10-01 22:58:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-01 22:58:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 260 transitions. [2019-10-01 22:58:12,654 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 260 transitions. Word has length 225 [2019-10-01 22:58:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:12,654 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 260 transitions. [2019-10-01 22:58:12,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:58:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 260 transitions. [2019-10-01 22:58:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-01 22:58:12,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:12,657 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:12,658 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -576199920, now seen corresponding path program 11 times [2019-10-01 22:58:12,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:12,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-10-01 22:58:12,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:12,973 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:13,024 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:00:03,403 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 23:00:03,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:03,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:00:03,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-10-01 23:00:03,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:03,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:00:03,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:00:03,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:00:03,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:00:03,586 INFO L87 Difference]: Start difference. First operand 250 states and 260 transitions. Second operand 15 states. [2019-10-01 23:00:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:04,110 INFO L93 Difference]: Finished difference Result 480 states and 507 transitions. [2019-10-01 23:00:04,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:00:04,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 245 [2019-10-01 23:00:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:04,112 INFO L225 Difference]: With dead ends: 480 [2019-10-01 23:00:04,113 INFO L226 Difference]: Without dead ends: 277 [2019-10-01 23:00:04,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:00:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-01 23:00:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 268. [2019-10-01 23:00:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-01 23:00:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 278 transitions. [2019-10-01 23:00:04,125 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 278 transitions. Word has length 245 [2019-10-01 23:00:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:04,125 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 278 transitions. [2019-10-01 23:00:04,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:00:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 278 transitions. [2019-10-01 23:00:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-01 23:00:04,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:04,129 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:04,130 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1982618206, now seen corresponding path program 12 times [2019-10-01 23:00:04,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:04,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:04,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2019-10-01 23:00:04,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:04,728 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:04,751 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:01:41,305 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:01:41,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:41,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 23:01:41,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 107 proven. 144 refuted. 0 times theorem prover too weak. 1109 trivial. 0 not checked. [2019-10-01 23:01:41,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:41,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 20 [2019-10-01 23:01:41,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:01:41,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:01:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:01:41,544 INFO L87 Difference]: Start difference. First operand 268 states and 278 transitions. Second operand 20 states. [2019-10-01 23:01:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:42,425 INFO L93 Difference]: Finished difference Result 523 states and 559 transitions. [2019-10-01 23:01:42,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:01:42,425 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 263 [2019-10-01 23:01:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:42,428 INFO L225 Difference]: With dead ends: 523 [2019-10-01 23:01:42,428 INFO L226 Difference]: Without dead ends: 304 [2019-10-01 23:01:42,429 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:01:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-01 23:01:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-10-01 23:01:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-01 23:01:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 314 transitions. [2019-10-01 23:01:42,442 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 314 transitions. Word has length 263 [2019-10-01 23:01:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:42,442 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 314 transitions. [2019-10-01 23:01:42,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:01:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 314 transitions. [2019-10-01 23:01:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-01 23:01:42,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:42,447 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:42,447 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:42,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1868808826, now seen corresponding path program 13 times [2019-10-01 23:01:42,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:42,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:42,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:42,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:42,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1828 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2019-10-01 23:01:43,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:43,156 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:43,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:01:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:43,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:01:43,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1828 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-10-01 23:01:43,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:43,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2019-10-01 23:01:43,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:01:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:01:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:01:43,554 INFO L87 Difference]: Start difference. First operand 304 states and 314 transitions. Second operand 26 states. [2019-10-01 23:01:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:44,262 INFO L93 Difference]: Finished difference Result 615 states and 644 transitions. [2019-10-01 23:01:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:01:44,269 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 299 [2019-10-01 23:01:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:44,271 INFO L225 Difference]: With dead ends: 615 [2019-10-01 23:01:44,271 INFO L226 Difference]: Without dead ends: 334 [2019-10-01 23:01:44,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:01:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-01 23:01:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2019-10-01 23:01:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-01 23:01:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 334 transitions. [2019-10-01 23:01:44,287 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 334 transitions. Word has length 299 [2019-10-01 23:01:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:44,288 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 334 transitions. [2019-10-01 23:01:44,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:01:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 334 transitions. [2019-10-01 23:01:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-10-01 23:01:44,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:44,293 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:44,294 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash -439822106, now seen corresponding path program 14 times [2019-10-01 23:01:44,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:44,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:01:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 1881 trivial. 0 not checked. [2019-10-01 23:01:45,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:45,005 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:45,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:01:45,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:01:45,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:45,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:01:45,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-10-01 23:01:45,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:45,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2019-10-01 23:01:45,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:01:45,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:01:45,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:01:45,527 INFO L87 Difference]: Start difference. First operand 324 states and 334 transitions. Second operand 28 states. [2019-10-01 23:01:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:46,318 INFO L93 Difference]: Finished difference Result 653 states and 682 transitions. [2019-10-01 23:01:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:01:46,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 319 [2019-10-01 23:01:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:46,322 INFO L225 Difference]: With dead ends: 653 [2019-10-01 23:01:46,322 INFO L226 Difference]: Without dead ends: 354 [2019-10-01 23:01:46,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:01:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-01 23:01:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 344. [2019-10-01 23:01:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-01 23:01:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 354 transitions. [2019-10-01 23:01:46,340 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 354 transitions. Word has length 319 [2019-10-01 23:01:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:46,341 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 354 transitions. [2019-10-01 23:01:46,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:01:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 354 transitions. [2019-10-01 23:01:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-01 23:01:46,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:46,346 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:46,346 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -830918318, now seen corresponding path program 15 times [2019-10-01 23:01:46,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:46,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:46,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:46,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:46,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2019-10-01 23:01:47,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:47,299 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:47,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:02:50,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 23:02:50,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:50,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 23:02:50,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-10-01 23:02:50,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:50,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2019-10-01 23:02:50,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:02:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:02:50,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:02:50,569 INFO L87 Difference]: Start difference. First operand 344 states and 354 transitions. Second operand 30 states. [2019-10-01 23:02:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:51,248 INFO L93 Difference]: Finished difference Result 691 states and 720 transitions. [2019-10-01 23:02:51,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:02:51,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 339 [2019-10-01 23:02:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:51,252 INFO L225 Difference]: With dead ends: 691 [2019-10-01 23:02:51,252 INFO L226 Difference]: Without dead ends: 374 [2019-10-01 23:02:51,253 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:02:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-10-01 23:02:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 364. [2019-10-01 23:02:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-10-01 23:02:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2019-10-01 23:02:51,267 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 339 [2019-10-01 23:02:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:51,267 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2019-10-01 23:02:51,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:02:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2019-10-01 23:02:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-10-01 23:02:51,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:51,270 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:51,271 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash 128175038, now seen corresponding path program 16 times [2019-10-01 23:02:51,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:51,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:51,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2722 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2019-10-01 23:02:51,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:51,940 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:02:51,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:02:52,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:02:52,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:52,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:02:52,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2722 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2019-10-01 23:02:52,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:52,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:02:52,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:02:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:02:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:02:52,235 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 21 states. [2019-10-01 23:02:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:52,957 INFO L93 Difference]: Finished difference Result 690 states and 717 transitions. [2019-10-01 23:02:52,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:02:52,958 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 359 [2019-10-01 23:02:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:52,961 INFO L225 Difference]: With dead ends: 690 [2019-10-01 23:02:52,961 INFO L226 Difference]: Without dead ends: 391 [2019-10-01 23:02:52,962 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 359 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-01 23:02:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-10-01 23:02:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 382. [2019-10-01 23:02:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-01 23:02:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 392 transitions. [2019-10-01 23:02:52,975 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 392 transitions. Word has length 359 [2019-10-01 23:02:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:52,975 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 392 transitions. [2019-10-01 23:02:52,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:02:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 392 transitions. [2019-10-01 23:02:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-01 23:02:52,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:52,979 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:52,979 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:52,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash -998263924, now seen corresponding path program 17 times [2019-10-01 23:02:52,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:52,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3037 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2713 trivial. 0 not checked. [2019-10-01 23:02:53,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:53,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:02:53,764 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:05:58,568 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-01 23:05:58,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:05:58,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:05:58,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3037 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2713 trivial. 0 not checked. [2019-10-01 23:05:58,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:58,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:05:58,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:05:58,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:05:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:05:58,836 INFO L87 Difference]: Start difference. First operand 382 states and 392 transitions. Second operand 22 states. [2019-10-01 23:05:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:59,486 INFO L93 Difference]: Finished difference Result 724 states and 751 transitions. [2019-10-01 23:05:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:05:59,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 377 [2019-10-01 23:05:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:59,490 INFO L225 Difference]: With dead ends: 724 [2019-10-01 23:05:59,490 INFO L226 Difference]: Without dead ends: 409 [2019-10-01 23:05:59,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:05:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-01 23:05:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 400. [2019-10-01 23:05:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-01 23:05:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 410 transitions. [2019-10-01 23:05:59,505 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 410 transitions. Word has length 377 [2019-10-01 23:05:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:59,506 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 410 transitions. [2019-10-01 23:05:59,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:05:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 410 transitions. [2019-10-01 23:05:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-10-01 23:05:59,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:59,509 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:59,509 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash 54199258, now seen corresponding path program 18 times [2019-10-01 23:05:59,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:59,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:59,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:59,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:05:59,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3370 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 3009 trivial. 0 not checked. [2019-10-01 23:06:00,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:00,621 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:06:00,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:09:00,037 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-10-01 23:09:00,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:09:00,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 102 conjunts are in the unsatisfiable core [2019-10-01 23:09:00,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:09:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3370 backedges. 21 proven. 361 refuted. 0 times theorem prover too weak. 2988 trivial. 0 not checked. [2019-10-01 23:09:00,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:09:00,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 25 [2019-10-01 23:09:00,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:09:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:09:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:09:00,359 INFO L87 Difference]: Start difference. First operand 400 states and 410 transitions. Second operand 25 states. [2019-10-01 23:09:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:09:01,772 INFO L93 Difference]: Finished difference Result 758 states and 785 transitions. [2019-10-01 23:09:01,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:09:01,773 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 395 [2019-10-01 23:09:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:09:01,776 INFO L225 Difference]: With dead ends: 758 [2019-10-01 23:09:01,776 INFO L226 Difference]: Without dead ends: 427 [2019-10-01 23:09:01,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=719, Invalid=1261, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:09:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-01 23:09:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 418. [2019-10-01 23:09:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-01 23:09:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 428 transitions. [2019-10-01 23:09:01,792 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 428 transitions. Word has length 395 [2019-10-01 23:09:01,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:09:01,792 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 428 transitions. [2019-10-01 23:09:01,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:09:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 428 transitions. [2019-10-01 23:09:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-10-01 23:09:01,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:09:01,796 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:09:01,796 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:09:01,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:09:01,796 INFO L82 PathProgramCache]: Analyzing trace with hash 594320552, now seen corresponding path program 19 times [2019-10-01 23:09:01,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:09:01,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:09:01,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:01,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:09:01,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:09:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-10-01 23:09:02,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:09:02,685 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:09:02,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:09:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:09:02,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:09:02,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:09:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-10-01 23:09:03,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:09:03,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2019-10-01 23:09:03,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:09:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:09:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:09:03,262 INFO L87 Difference]: Start difference. First operand 418 states and 428 transitions. Second operand 35 states. [2019-10-01 23:09:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:09:04,356 INFO L93 Difference]: Finished difference Result 837 states and 866 transitions. [2019-10-01 23:09:04,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:09:04,356 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 413 [2019-10-01 23:09:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:09:04,358 INFO L225 Difference]: With dead ends: 837 [2019-10-01 23:09:04,359 INFO L226 Difference]: Without dead ends: 448 [2019-10-01 23:09:04,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:09:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-01 23:09:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2019-10-01 23:09:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-10-01 23:09:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 448 transitions. [2019-10-01 23:09:04,374 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 448 transitions. Word has length 413 [2019-10-01 23:09:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:09:04,374 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 448 transitions. [2019-10-01 23:09:04,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:09:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 448 transitions. [2019-10-01 23:09:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-10-01 23:09:04,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:09:04,378 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:09:04,378 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:09:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:09:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1858539500, now seen corresponding path program 20 times [2019-10-01 23:09:04,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:09:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:09:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:04,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:09:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:09:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2019-10-01 23:09:05,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:09:05,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:09:05,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:09:05,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:09:05,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:09:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:09:05,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:09:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 3969 trivial. 0 not checked. [2019-10-01 23:09:05,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:09:05,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2019-10-01 23:09:05,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:09:05,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:09:05,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=952, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:09:05,788 INFO L87 Difference]: Start difference. First operand 438 states and 448 transitions. Second operand 37 states. [2019-10-01 23:09:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:09:06,768 INFO L93 Difference]: Finished difference Result 875 states and 904 transitions. [2019-10-01 23:09:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:09:06,769 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 433 [2019-10-01 23:09:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:09:06,772 INFO L225 Difference]: With dead ends: 875 [2019-10-01 23:09:06,772 INFO L226 Difference]: Without dead ends: 468 [2019-10-01 23:09:06,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=952, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:09:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-10-01 23:09:06,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 458. [2019-10-01 23:09:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-01 23:09:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 468 transitions. [2019-10-01 23:09:06,788 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 468 transitions. Word has length 433 [2019-10-01 23:09:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:09:06,788 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 468 transitions. [2019-10-01 23:09:06,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:09:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 468 transitions. [2019-10-01 23:09:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-01 23:09:06,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:09:06,792 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:09:06,792 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:09:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:09:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash 765986176, now seen corresponding path program 21 times [2019-10-01 23:09:06,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:09:06,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:09:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:06,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:09:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:09:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4525 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 4041 trivial. 0 not checked. [2019-10-01 23:09:07,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:09:07,434 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:09:07,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:10:39,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 23:10:39,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:10:39,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:10:39,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4525 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 4356 trivial. 0 not checked. [2019-10-01 23:10:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:39,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 39 [2019-10-01 23:10:39,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:10:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:10:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:10:39,452 INFO L87 Difference]: Start difference. First operand 458 states and 468 transitions. Second operand 39 states. [2019-10-01 23:10:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:40,525 INFO L93 Difference]: Finished difference Result 913 states and 942 transitions. [2019-10-01 23:10:40,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:10:40,528 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 453 [2019-10-01 23:10:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:40,531 INFO L225 Difference]: With dead ends: 913 [2019-10-01 23:10:40,531 INFO L226 Difference]: Without dead ends: 488 [2019-10-01 23:10:40,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:10:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-10-01 23:10:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2019-10-01 23:10:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-10-01 23:10:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 488 transitions. [2019-10-01 23:10:40,546 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 488 transitions. Word has length 453 [2019-10-01 23:10:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:40,546 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 488 transitions. [2019-10-01 23:10:40,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:10:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 488 transitions. [2019-10-01 23:10:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-10-01 23:10:40,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:40,551 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:40,551 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash -500638484, now seen corresponding path program 22 times [2019-10-01 23:10:40,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:40,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:40,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:10:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4957 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 4428 trivial. 0 not checked. [2019-10-01 23:10:41,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:41,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:10:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:10:41,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:10:41,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:10:41,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:10:41,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4957 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 4761 trivial. 0 not checked. [2019-10-01 23:10:41,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:41,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 41 [2019-10-01 23:10:41,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:10:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:10:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:10:41,814 INFO L87 Difference]: Start difference. First operand 478 states and 488 transitions. Second operand 41 states. [2019-10-01 23:10:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:42,820 INFO L93 Difference]: Finished difference Result 951 states and 980 transitions. [2019-10-01 23:10:42,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:10:42,821 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 473 [2019-10-01 23:10:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:42,823 INFO L225 Difference]: With dead ends: 951 [2019-10-01 23:10:42,823 INFO L226 Difference]: Without dead ends: 508 [2019-10-01 23:10:42,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:10:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-10-01 23:10:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 498. [2019-10-01 23:10:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-01 23:10:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 508 transitions. [2019-10-01 23:10:42,838 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 508 transitions. Word has length 473 [2019-10-01 23:10:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:42,839 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 508 transitions. [2019-10-01 23:10:42,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:10:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 508 transitions. [2019-10-01 23:10:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-10-01 23:10:42,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:42,843 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:42,843 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash -978684328, now seen corresponding path program 23 times [2019-10-01 23:10:42,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:42,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:42,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:42,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:10:42,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5409 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 4833 trivial. 0 not checked. [2019-10-01 23:10:44,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:44,167 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:10:44,229 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1