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/data_structures_set_multi_proc_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:15:35,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:15:35,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:15:35,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:15:35,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:15:35,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:15:35,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:15:35,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:15:35,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:15:35,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:15:35,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:15:35,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:15:35,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:15:35,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:15:35,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:15:35,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:15:35,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:15:35,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:15:35,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:15:35,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:15:35,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:15:35,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:15:35,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:15:35,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:15:35,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:15:35,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:15:35,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:15:35,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:15:35,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:15:35,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:15:35,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:15:35,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:15:35,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:15:35,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:15:35,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:15:35,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:15:35,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:15:35,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:15:35,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:15:35,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:15:35,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:15:35,404 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:15:35,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:15:35,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:15:35,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:15:35,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:15:35,426 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:15:35,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:15:35,427 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:15:35,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:15:35,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:15:35,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:15:35,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:15:35,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:15:35,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:15:35,428 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:15:35,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:15:35,428 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:15:35,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:15:35,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:15:35,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:15:35,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:15:35,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:15:35,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:15:35,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:15:35,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:15:35,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:15:35,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:15:35,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:15:35,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:15:35,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:15:35,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:15:35,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:15:35,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:15:35,497 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:15:35,497 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:15:35,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-1.i [2019-10-01 22:15:35,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c272a14/d01d92c7c7a240ef9358d1fb345409e4/FLAG65c5df9e3 [2019-10-01 22:15:35,948 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:15:35,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_ground-1.i [2019-10-01 22:15:35,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c272a14/d01d92c7c7a240ef9358d1fb345409e4/FLAG65c5df9e3 [2019-10-01 22:15:36,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c272a14/d01d92c7c7a240ef9358d1fb345409e4 [2019-10-01 22:15:36,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:15:36,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:15:36,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:15:36,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:15:36,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:15:36,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405f9137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36, skipping insertion in model container [2019-10-01 22:15:36,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,357 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:15:36,375 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:15:36,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:15:36,634 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:15:36,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:15:36,768 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:15:36,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36 WrapperNode [2019-10-01 22:15:36,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:15:36,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:15:36,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:15:36,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:15:36,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (1/1) ... [2019-10-01 22:15:36,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:15:36,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:15:36,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:15:36,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:15:36,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (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:15:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:15:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:15:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:15:36,877 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-01 22:15:36,877 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-01 22:15:36,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:15:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:15:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:15:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-01 22:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-01 22:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:15:37,276 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:15:37,276 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-01 22:15:37,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:15:37 BoogieIcfgContainer [2019-10-01 22:15:37,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:15:37,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:15:37,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:15:37,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:15:37,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:15:36" (1/3) ... [2019-10-01 22:15:37,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fa1515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:15:37, skipping insertion in model container [2019-10-01 22:15:37,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:15:36" (2/3) ... [2019-10-01 22:15:37,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fa1515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:15:37, skipping insertion in model container [2019-10-01 22:15:37,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:15:37" (3/3) ... [2019-10-01 22:15:37,285 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-1.i [2019-10-01 22:15:37,294 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:15:37,301 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:15:37,318 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:15:37,347 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:15:37,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:15:37,348 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:15:37,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:15:37,348 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:15:37,348 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:15:37,348 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:15:37,348 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:15:37,349 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:15:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-10-01 22:15:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-01 22:15:37,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:37,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:37,372 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:37,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:37,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1780536170, now seen corresponding path program 1 times [2019-10-01 22:15:37,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:37,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:37,518 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:15:37,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:15:37,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:15:37,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:15:37,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:15:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:15:37,535 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2019-10-01 22:15:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:37,653 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2019-10-01 22:15:37,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:15:37,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-01 22:15:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:37,672 INFO L225 Difference]: With dead ends: 129 [2019-10-01 22:15:37,672 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 22:15:37,679 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:15:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 22:15:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 50. [2019-10-01 22:15:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 22:15:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-10-01 22:15:37,749 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2019-10-01 22:15:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:37,749 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-10-01 22:15:37,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:15:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-10-01 22:15:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:15:37,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:37,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:37,754 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2111973388, now seen corresponding path program 1 times [2019-10-01 22:15:37,756 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:37,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:37,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:37,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:37,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:15:37,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:37,843 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:37,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:37,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:15:37,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:15:37,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:37,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:15:37,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:15:37,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:15:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:15:37,960 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 5 states. [2019-10-01 22:15:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:38,086 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2019-10-01 22:15:38,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:15:38,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-01 22:15:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:38,089 INFO L225 Difference]: With dead ends: 142 [2019-10-01 22:15:38,089 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 22:15:38,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:15:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 22:15:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 52. [2019-10-01 22:15:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:15:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-10-01 22:15:38,102 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 16 [2019-10-01 22:15:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:38,102 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-10-01 22:15:38,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:15:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-10-01 22:15:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:15:38,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:38,103 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:38,104 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:38,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1499407314, now seen corresponding path program 2 times [2019-10-01 22:15:38,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:38,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:15:38,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:38,173 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:15:38,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:15:38,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-01 22:15:38,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:38,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:15:38,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:15:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:15:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-01 22:15:38,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:15:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:15:38,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:15:38,260 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 7 states. [2019-10-01 22:15:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:38,392 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2019-10-01 22:15:38,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:15:38,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-01 22:15:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:38,398 INFO L225 Difference]: With dead ends: 118 [2019-10-01 22:15:38,398 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 22:15:38,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:15:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 22:15:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 54. [2019-10-01 22:15:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-01 22:15:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-10-01 22:15:38,408 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 18 [2019-10-01 22:15:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:38,409 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-01 22:15:38,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:15:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-10-01 22:15:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 22:15:38,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:38,410 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-10-01 22:15:38,411 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:38,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:38,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1656413009, now seen corresponding path program 1 times [2019-10-01 22:15:38,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:38,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:38,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:38,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 22:15:38,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:15:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:15:38,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:15:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:15:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:15:38,468 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2019-10-01 22:15:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:38,502 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2019-10-01 22:15:38,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:15:38,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-01 22:15:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:38,504 INFO L225 Difference]: With dead ends: 100 [2019-10-01 22:15:38,504 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:15:38,506 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:15:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:15:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-01 22:15:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 22:15:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-10-01 22:15:38,519 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 41 [2019-10-01 22:15:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:38,520 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-10-01 22:15:38,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:15:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-10-01 22:15:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 22:15:38,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:38,521 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:38,522 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1873779725, now seen corresponding path program 1 times [2019-10-01 22:15:38,522 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:38,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:15:38,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:38,663 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:15:38,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:15:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:38,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:15:38,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:15:38,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:38,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:15:38,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:15:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:15:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:15:38,755 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 7 states. [2019-10-01 22:15:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:38,824 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2019-10-01 22:15:38,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:15:38,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-10-01 22:15:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:38,826 INFO L225 Difference]: With dead ends: 124 [2019-10-01 22:15:38,826 INFO L226 Difference]: Without dead ends: 82 [2019-10-01 22:15:38,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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:15:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-01 22:15:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 57. [2019-10-01 22:15:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 22:15:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-10-01 22:15:38,835 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 43 [2019-10-01 22:15:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:38,835 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-10-01 22:15:38,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:15:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-10-01 22:15:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 22:15:38,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:38,837 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:38,837 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:38,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:38,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1255972181, now seen corresponding path program 2 times [2019-10-01 22:15:38,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:38,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:38,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:38,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:15:38,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:38,915 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:38,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:15:38,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:15:38,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:38,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:15:38,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:15:39,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:39,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:15:39,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:15:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:15:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:15:39,011 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 8 states. [2019-10-01 22:15:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:39,092 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-10-01 22:15:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:15:39,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-01 22:15:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:39,093 INFO L225 Difference]: With dead ends: 132 [2019-10-01 22:15:39,094 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 22:15:39,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:15:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 22:15:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-10-01 22:15:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:15:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-10-01 22:15:39,102 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 45 [2019-10-01 22:15:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:39,103 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-10-01 22:15:39,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:15:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-10-01 22:15:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:15:39,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:39,105 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:39,105 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1824520649, now seen corresponding path program 3 times [2019-10-01 22:15:39,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:39,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:39,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:39,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:39,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:15:39,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:39,229 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:15:39,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:15:39,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 22:15:39,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:39,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:15:39,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 22:15:39,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:39,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-01 22:15:39,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:15:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:15:39,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:15:39,425 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 14 states. [2019-10-01 22:15:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:39,783 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2019-10-01 22:15:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:15:39,784 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-10-01 22:15:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:39,785 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:15:39,785 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 22:15:39,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:15:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 22:15:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2019-10-01 22:15:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 22:15:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-10-01 22:15:39,795 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 47 [2019-10-01 22:15:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:39,796 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-10-01 22:15:39,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:15:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-10-01 22:15:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 22:15:39,797 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:39,797 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-10-01 22:15:39,798 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:39,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash 162129473, now seen corresponding path program 4 times [2019-10-01 22:15:39,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:39,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-01 22:15:39,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:39,956 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:15:39,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:15:40,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:15:40,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:40,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:15:40,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 22:15:40,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-01 22:15:40,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:15:40,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:15:40,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:15:40,150 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 15 states. [2019-10-01 22:15:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:40,527 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2019-10-01 22:15:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:15:40,527 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2019-10-01 22:15:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:40,530 INFO L225 Difference]: With dead ends: 183 [2019-10-01 22:15:40,531 INFO L226 Difference]: Without dead ends: 134 [2019-10-01 22:15:40,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:15:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-01 22:15:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2019-10-01 22:15:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-01 22:15:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2019-10-01 22:15:40,542 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 64 [2019-10-01 22:15:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:40,543 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-10-01 22:15:40,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:15:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2019-10-01 22:15:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-01 22:15:40,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:40,545 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 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] [2019-10-01 22:15:40,545 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:40,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:40,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1586630362, now seen corresponding path program 1 times [2019-10-01 22:15:40,545 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:40,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:40,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:40,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:40,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-01 22:15:40,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:40,661 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:15:40,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:40,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:15:40,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:15:40,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:40,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:15:40,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:15:40,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:15:40,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:15:40,776 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 11 states. [2019-10-01 22:15:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:40,893 INFO L93 Difference]: Finished difference Result 196 states and 246 transitions. [2019-10-01 22:15:40,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:15:40,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-10-01 22:15:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:40,895 INFO L225 Difference]: With dead ends: 196 [2019-10-01 22:15:40,895 INFO L226 Difference]: Without dead ends: 134 [2019-10-01 22:15:40,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:15:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-01 22:15:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2019-10-01 22:15:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 22:15:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2019-10-01 22:15:40,905 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 66 [2019-10-01 22:15:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:40,905 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-10-01 22:15:40,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:15:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2019-10-01 22:15:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 22:15:40,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:40,907 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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] [2019-10-01 22:15:40,907 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1698018940, now seen corresponding path program 2 times [2019-10-01 22:15:40,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:40,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:40,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-01 22:15:41,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:41,000 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:15:41,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:15:41,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:15:41,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:41,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:15:41,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-01 22:15:41,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:41,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:15:41,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:15:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:15:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:15:41,127 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 12 states. [2019-10-01 22:15:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:41,227 INFO L93 Difference]: Finished difference Result 204 states and 256 transitions. [2019-10-01 22:15:41,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:15:41,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-10-01 22:15:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:41,229 INFO L225 Difference]: With dead ends: 204 [2019-10-01 22:15:41,229 INFO L226 Difference]: Without dead ends: 142 [2019-10-01 22:15:41,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:15:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-01 22:15:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2019-10-01 22:15:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:15:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2019-10-01 22:15:41,239 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 68 [2019-10-01 22:15:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:41,239 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2019-10-01 22:15:41,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:15:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2019-10-01 22:15:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:15:41,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:41,241 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 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] [2019-10-01 22:15:41,241 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1368259998, now seen corresponding path program 3 times [2019-10-01 22:15:41,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:41,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:41,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-01 22:15:41,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:41,359 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:15:41,390 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:15:41,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 22:15:41,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:41,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:15:41,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-01 22:15:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-10-01 22:15:41,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:15:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:15:41,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:15:41,470 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 14 states. [2019-10-01 22:15:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:41,668 INFO L93 Difference]: Finished difference Result 238 states and 304 transitions. [2019-10-01 22:15:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:15:41,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-10-01 22:15:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:41,670 INFO L225 Difference]: With dead ends: 238 [2019-10-01 22:15:41,670 INFO L226 Difference]: Without dead ends: 176 [2019-10-01 22:15:41,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:15:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-01 22:15:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 91. [2019-10-01 22:15:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 22:15:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2019-10-01 22:15:41,681 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 70 [2019-10-01 22:15:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:41,681 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2019-10-01 22:15:41,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:15:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2019-10-01 22:15:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 22:15:41,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:41,682 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 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] [2019-10-01 22:15:41,683 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1335758558, now seen corresponding path program 4 times [2019-10-01 22:15:41,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:41,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-01 22:15:41,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:41,815 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:15:41,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:15:41,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:15:41,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:41,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:15:41,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-01 22:15:41,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:41,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:15:41,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:15:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:15:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:15:41,933 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand 14 states. [2019-10-01 22:15:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:42,066 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2019-10-01 22:15:42,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:15:42,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-10-01 22:15:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:42,070 INFO L225 Difference]: With dead ends: 224 [2019-10-01 22:15:42,070 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 22:15:42,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:15:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 22:15:42,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 93. [2019-10-01 22:15:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:15:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-10-01 22:15:42,085 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 74 [2019-10-01 22:15:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:42,085 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-10-01 22:15:42,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:15:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2019-10-01 22:15:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 22:15:42,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:42,087 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 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] [2019-10-01 22:15:42,087 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:42,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:42,087 INFO L82 PathProgramCache]: Analyzing trace with hash -608381244, now seen corresponding path program 5 times [2019-10-01 22:15:42,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:42,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:42,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:42,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:42,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-01 22:15:42,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:42,238 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:15:42,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:15:42,414 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 22:15:42,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:42,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:15:42,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 22:15:42,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:42,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-10-01 22:15:42,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:15:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:15:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:15:42,472 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 17 states. [2019-10-01 22:15:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:42,717 INFO L93 Difference]: Finished difference Result 277 states and 358 transitions. [2019-10-01 22:15:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:15:42,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 22:15:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:42,719 INFO L225 Difference]: With dead ends: 277 [2019-10-01 22:15:42,719 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:15:42,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=229, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:15:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:15:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 112. [2019-10-01 22:15:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 22:15:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2019-10-01 22:15:42,730 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 76 [2019-10-01 22:15:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:42,730 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2019-10-01 22:15:42,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:15:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2019-10-01 22:15:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-01 22:15:42,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:42,732 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-01 22:15:42,732 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:42,733 INFO L82 PathProgramCache]: Analyzing trace with hash 922611826, now seen corresponding path program 1 times [2019-10-01 22:15:42,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:42,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:42,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:42,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:42,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 22:15:42,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:15:42,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-01 22:15:42,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:15:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:15:42,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:15:42,784 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 4 states. [2019-10-01 22:15:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:42,794 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2019-10-01 22:15:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:15:42,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-01 22:15:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:42,796 INFO L225 Difference]: With dead ends: 155 [2019-10-01 22:15:42,796 INFO L226 Difference]: Without dead ends: 100 [2019-10-01 22:15:42,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:15:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-01 22:15:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-01 22:15:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 22:15:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2019-10-01 22:15:42,803 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 90 [2019-10-01 22:15:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:42,804 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2019-10-01 22:15:42,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:15:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2019-10-01 22:15:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 22:15:42,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:42,805 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:42,805 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:42,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash -30272960, now seen corresponding path program 6 times [2019-10-01 22:15:42,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:42,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-01 22:15:42,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:42,915 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:15:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:15:42,980 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-10-01 22:15:42,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:42,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:15:42,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-10-01 22:15:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:15:43,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2019-10-01 22:15:43,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:15:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:15:43,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:15:43,124 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand 18 states. [2019-10-01 22:15:43,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:43,375 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2019-10-01 22:15:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:15:43,375 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2019-10-01 22:15:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:43,377 INFO L225 Difference]: With dead ends: 140 [2019-10-01 22:15:43,377 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 22:15:43,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:15:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 22:15:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2019-10-01 22:15:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:15:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-10-01 22:15:43,384 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 95 [2019-10-01 22:15:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:43,385 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-10-01 22:15:43,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:15:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-10-01 22:15:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 22:15:43,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:43,386 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:43,386 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 768414391, now seen corresponding path program 7 times [2019-10-01 22:15:43,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:43,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:43,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 22:15:43,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:43,529 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 22:15:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:43,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:15:43,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 22:15:43,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:43,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:15:43,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:15:43,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:15:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:15:43,643 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 16 states. [2019-10-01 22:15:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:43,797 INFO L93 Difference]: Finished difference Result 240 states and 290 transitions. [2019-10-01 22:15:43,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:15:43,798 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 95 [2019-10-01 22:15:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:43,799 INFO L225 Difference]: With dead ends: 240 [2019-10-01 22:15:43,799 INFO L226 Difference]: Without dead ends: 176 [2019-10-01 22:15:43,800 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:15:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-01 22:15:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 97. [2019-10-01 22:15:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 22:15:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-10-01 22:15:43,808 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 95 [2019-10-01 22:15:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:43,808 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-10-01 22:15:43,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:15:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-10-01 22:15:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 22:15:43,809 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:43,810 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:43,810 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:43,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1061381717, now seen corresponding path program 8 times [2019-10-01 22:15:43,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:43,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:43,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 22:15:43,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:43,952 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 22:15:43,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:15:44,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:15:44,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:44,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:15:44,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:15:44,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:44,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:15:44,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:15:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:15:44,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:15:44,072 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 17 states. [2019-10-01 22:15:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:44,260 INFO L93 Difference]: Finished difference Result 248 states and 300 transitions. [2019-10-01 22:15:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:15:44,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2019-10-01 22:15:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:44,262 INFO L225 Difference]: With dead ends: 248 [2019-10-01 22:15:44,262 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:15:44,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:15:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:15:44,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 99. [2019-10-01 22:15:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 22:15:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-10-01 22:15:44,271 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 97 [2019-10-01 22:15:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:44,271 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-10-01 22:15:44,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:15:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-10-01 22:15:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 22:15:44,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:44,272 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:15:44,273 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash -864859533, now seen corresponding path program 9 times [2019-10-01 22:15:44,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:44,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:44,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:44,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 22:15:44,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:44,441 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 22:15:44,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:15:44,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:15:44,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:44,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:15:44,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-10-01 22:15:44,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:44,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 21 [2019-10-01 22:15:44,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:15:44,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:15:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:15:44,699 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 21 states. [2019-10-01 22:15:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:45,129 INFO L93 Difference]: Finished difference Result 272 states and 332 transitions. [2019-10-01 22:15:45,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:15:45,129 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2019-10-01 22:15:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:45,131 INFO L225 Difference]: With dead ends: 272 [2019-10-01 22:15:45,131 INFO L226 Difference]: Without dead ends: 208 [2019-10-01 22:15:45,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:15:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-01 22:15:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 110. [2019-10-01 22:15:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 22:15:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-10-01 22:15:45,141 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 99 [2019-10-01 22:15:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:45,141 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-10-01 22:15:45,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:15:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-10-01 22:15:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 22:15:45,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:45,143 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 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] [2019-10-01 22:15:45,143 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash -32681552, now seen corresponding path program 10 times [2019-10-01 22:15:45,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:45,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-01 22:15:45,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:45,335 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 22:15:45,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:15:45,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:15:45,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:45,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:15:45,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-01 22:15:45,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:45,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:15:45,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:15:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:15:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:15:45,497 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 19 states. [2019-10-01 22:15:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:45,705 INFO L93 Difference]: Finished difference Result 282 states and 342 transitions. [2019-10-01 22:15:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:15:45,706 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 118 [2019-10-01 22:15:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:45,707 INFO L225 Difference]: With dead ends: 282 [2019-10-01 22:15:45,707 INFO L226 Difference]: Without dead ends: 209 [2019-10-01 22:15:45,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:15:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-01 22:15:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 112. [2019-10-01 22:15:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 22:15:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-10-01 22:15:45,717 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 118 [2019-10-01 22:15:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:45,717 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-10-01 22:15:45,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:15:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-10-01 22:15:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-01 22:15:45,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:45,719 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 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] [2019-10-01 22:15:45,719 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1306538926, now seen corresponding path program 11 times [2019-10-01 22:15:45,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:45,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:45,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:45,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-01 22:15:45,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:45,941 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 22:15:45,969 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:15:46,693 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:15:46,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:46,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:15:46,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:15:46,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:46,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:15:46,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:15:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:15:46,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:15:46,746 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 20 states. [2019-10-01 22:15:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:46,999 INFO L93 Difference]: Finished difference Result 290 states and 352 transitions. [2019-10-01 22:15:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:15:46,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2019-10-01 22:15:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:47,001 INFO L225 Difference]: With dead ends: 290 [2019-10-01 22:15:47,001 INFO L226 Difference]: Without dead ends: 217 [2019-10-01 22:15:47,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:15:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-01 22:15:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 114. [2019-10-01 22:15:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 22:15:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2019-10-01 22:15:47,011 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 120 [2019-10-01 22:15:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:47,012 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2019-10-01 22:15:47,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:15:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2019-10-01 22:15:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 22:15:47,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:47,013 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 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] [2019-10-01 22:15:47,013 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1417795980, now seen corresponding path program 12 times [2019-10-01 22:15:47,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:47,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:47,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:47,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-01 22:15:47,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:47,220 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 22:15:47,246 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:15:47,601 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 22:15:47,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:47,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:15:47,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-10-01 22:15:47,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:47,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 25 [2019-10-01 22:15:47,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:15:47,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:15:47,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=390, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:15:47,712 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 25 states. [2019-10-01 22:15:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:48,190 INFO L93 Difference]: Finished difference Result 314 states and 384 transitions. [2019-10-01 22:15:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:15:48,191 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2019-10-01 22:15:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:48,192 INFO L225 Difference]: With dead ends: 314 [2019-10-01 22:15:48,192 INFO L226 Difference]: Without dead ends: 241 [2019-10-01 22:15:48,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:15:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-01 22:15:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 125. [2019-10-01 22:15:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:15:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2019-10-01 22:15:48,206 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 122 [2019-10-01 22:15:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:48,207 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2019-10-01 22:15:48,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:15:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2019-10-01 22:15:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-01 22:15:48,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:48,209 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 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] [2019-10-01 22:15:48,209 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -717786105, now seen corresponding path program 13 times [2019-10-01 22:15:48,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:48,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:48,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 22:15:48,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:48,462 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:15:48,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:48,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:15:48,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 22:15:48,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:48,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:15:48,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:15:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:15:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:15:48,598 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 22 states. [2019-10-01 22:15:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:48,895 INFO L93 Difference]: Finished difference Result 324 states and 394 transitions. [2019-10-01 22:15:48,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:15:48,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 141 [2019-10-01 22:15:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:48,902 INFO L225 Difference]: With dead ends: 324 [2019-10-01 22:15:48,903 INFO L226 Difference]: Without dead ends: 242 [2019-10-01 22:15:48,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 141 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 22:15:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-01 22:15:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 127. [2019-10-01 22:15:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 22:15:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2019-10-01 22:15:48,917 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 141 [2019-10-01 22:15:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:48,917 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2019-10-01 22:15:48,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:15:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2019-10-01 22:15:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 22:15:48,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:48,919 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 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] [2019-10-01 22:15:48,919 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash -470277339, now seen corresponding path program 14 times [2019-10-01 22:15:48,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:48,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:15:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 22:15:49,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:49,265 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 22:15:49,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:15:49,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:15:49,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:49,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:15:49,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 22:15:49,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:49,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:15:49,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:15:49,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:15:49,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:15:49,436 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 23 states. [2019-10-01 22:15:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:49,770 INFO L93 Difference]: Finished difference Result 332 states and 404 transitions. [2019-10-01 22:15:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:15:49,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2019-10-01 22:15:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:49,772 INFO L225 Difference]: With dead ends: 332 [2019-10-01 22:15:49,772 INFO L226 Difference]: Without dead ends: 250 [2019-10-01 22:15:49,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:15:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-01 22:15:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 129. [2019-10-01 22:15:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 22:15:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2019-10-01 22:15:49,785 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 143 [2019-10-01 22:15:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:49,785 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2019-10-01 22:15:49,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:15:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2019-10-01 22:15:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-01 22:15:49,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:49,787 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 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] [2019-10-01 22:15:49,787 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1162445507, now seen corresponding path program 15 times [2019-10-01 22:15:49,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:49,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:49,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:49,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-01 22:15:50,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:50,076 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 22:15:50,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:15:50,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:15:50,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:50,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:15:50,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-10-01 22:15:50,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:50,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 29 [2019-10-01 22:15:50,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:15:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:15:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:15:50,435 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 29 states. [2019-10-01 22:15:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:51,010 INFO L93 Difference]: Finished difference Result 356 states and 436 transitions. [2019-10-01 22:15:51,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:15:51,011 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 145 [2019-10-01 22:15:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:51,012 INFO L225 Difference]: With dead ends: 356 [2019-10-01 22:15:51,012 INFO L226 Difference]: Without dead ends: 274 [2019-10-01 22:15:51,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=454, Invalid=736, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:15:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-01 22:15:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 140. [2019-10-01 22:15:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-01 22:15:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2019-10-01 22:15:51,026 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 145 [2019-10-01 22:15:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:51,027 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2019-10-01 22:15:51,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:15:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2019-10-01 22:15:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-01 22:15:51,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:51,028 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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:15:51,028 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash 177113184, now seen corresponding path program 16 times [2019-10-01 22:15:51,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:51,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-01 22:15:51,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:51,334 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:15:51,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:15:51,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:15:51,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:15:51,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:15:51,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:15:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:15:51,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:15:51,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:15:51,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:15:51,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:15:51,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:15:51,495 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 25 states. [2019-10-01 22:15:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:15:51,915 INFO L93 Difference]: Finished difference Result 366 states and 446 transitions. [2019-10-01 22:15:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:15:51,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 164 [2019-10-01 22:15:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:15:51,918 INFO L225 Difference]: With dead ends: 366 [2019-10-01 22:15:51,918 INFO L226 Difference]: Without dead ends: 275 [2019-10-01 22:15:51,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:15:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-01 22:15:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 142. [2019-10-01 22:15:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-01 22:15:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2019-10-01 22:15:51,934 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 164 [2019-10-01 22:15:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:15:51,934 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2019-10-01 22:15:51,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:15:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2019-10-01 22:15:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-01 22:15:51,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:15:51,936 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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:15:51,936 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:15:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:15:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -56117374, now seen corresponding path program 17 times [2019-10-01 22:15:51,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:15:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:15:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:51,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:15:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:15:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:15:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-01 22:15:52,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:15:52,302 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:15:52,336 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:16:07,084 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 22:16:07,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:16:07,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:16:07,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:16:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2019-10-01 22:16:07,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:16:07,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9] total 32 [2019-10-01 22:16:07,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:16:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:16:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:16:07,214 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 32 states. [2019-10-01 22:16:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:16:07,884 INFO L93 Difference]: Finished difference Result 390 states and 478 transitions. [2019-10-01 22:16:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:16:07,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 166 [2019-10-01 22:16:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:16:07,887 INFO L225 Difference]: With dead ends: 390 [2019-10-01 22:16:07,887 INFO L226 Difference]: Without dead ends: 299 [2019-10-01 22:16:07,888 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=559, Invalid=923, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:16:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-01 22:16:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 153. [2019-10-01 22:16:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 22:16:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2019-10-01 22:16:07,908 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 166 [2019-10-01 22:16:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:16:07,908 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2019-10-01 22:16:07,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:16:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2019-10-01 22:16:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-01 22:16:07,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:16:07,910 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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:16:07,910 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:16:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:16:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2058327239, now seen corresponding path program 18 times [2019-10-01 22:16:07,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:16:07,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:16:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:07,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:16:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:16:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-01 22:16:08,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:16:08,387 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:16:08,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:16:14,159 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 22:16:14,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:16:14,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:16:14,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:16:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 13 proven. 154 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-10-01 22:16:14,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:16:14,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 36 [2019-10-01 22:16:14,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:16:14,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:16:14,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=870, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:16:14,340 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand 36 states. [2019-10-01 22:16:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:16:15,598 INFO L93 Difference]: Finished difference Result 418 states and 514 transitions. [2019-10-01 22:16:15,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:16:15,598 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 185 [2019-10-01 22:16:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:16:15,600 INFO L225 Difference]: With dead ends: 418 [2019-10-01 22:16:15,600 INFO L226 Difference]: Without dead ends: 318 [2019-10-01 22:16:15,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1578, Invalid=3114, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 22:16:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-01 22:16:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 173. [2019-10-01 22:16:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 22:16:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 197 transitions. [2019-10-01 22:16:15,619 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 197 transitions. Word has length 185 [2019-10-01 22:16:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:16:15,620 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 197 transitions. [2019-10-01 22:16:15,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:16:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 197 transitions. [2019-10-01 22:16:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-01 22:16:15,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:16:15,622 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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:16:15,622 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:16:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:16:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 791444595, now seen corresponding path program 19 times [2019-10-01 22:16:15,622 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:16:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:16:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:15,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:16:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:16:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-10-01 22:16:16,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:16:16,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:16:16,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:16:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:16:16,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:16:16,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:16:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-10-01 22:16:16,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:16:16,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 22:16:16,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:16:16,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:16:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:16:16,252 INFO L87 Difference]: Start difference. First operand 173 states and 197 transitions. Second operand 28 states. [2019-10-01 22:16:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:16:16,967 INFO L93 Difference]: Finished difference Result 444 states and 542 transitions. [2019-10-01 22:16:16,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:16:16,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 221 [2019-10-01 22:16:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:16:16,969 INFO L225 Difference]: With dead ends: 444 [2019-10-01 22:16:16,969 INFO L226 Difference]: Without dead ends: 326 [2019-10-01 22:16:16,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:16:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-01 22:16:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 175. [2019-10-01 22:16:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-01 22:16:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2019-10-01 22:16:16,988 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 221 [2019-10-01 22:16:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:16:16,988 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2019-10-01 22:16:16,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:16:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2019-10-01 22:16:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-01 22:16:16,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:16:16,990 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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:16:16,990 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:16:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:16:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash -34652271, now seen corresponding path program 20 times [2019-10-01 22:16:16,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:16:16,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:16:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:16,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:16:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:16:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-10-01 22:16:17,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:16:17,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:16:17,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:16:17,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:16:17,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:16:17,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:16:17,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:16:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-10-01 22:16:17,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:16:17,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:16:17,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:16:17,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:16:17,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:16:17,867 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand 29 states. [2019-10-01 22:16:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:16:18,491 INFO L93 Difference]: Finished difference Result 452 states and 552 transitions. [2019-10-01 22:16:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:16:18,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 223 [2019-10-01 22:16:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:16:18,497 INFO L225 Difference]: With dead ends: 452 [2019-10-01 22:16:18,497 INFO L226 Difference]: Without dead ends: 334 [2019-10-01 22:16:18,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:16:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-01 22:16:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 177. [2019-10-01 22:16:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 22:16:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2019-10-01 22:16:18,523 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 223 [2019-10-01 22:16:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:16:18,524 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2019-10-01 22:16:18,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:16:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2019-10-01 22:16:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-01 22:16:18,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:16:18,526 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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:16:18,527 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:16:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:16:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash 655209263, now seen corresponding path program 21 times [2019-10-01 22:16:18,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:16:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:16:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:18,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:16:18,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:16:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-10-01 22:16:18,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:16:18,968 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:16:19,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:16:21,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-01 22:16:21,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:16:21,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:16:21,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:16:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 17 proven. 261 refuted. 0 times theorem prover too weak. 1020 trivial. 0 not checked. [2019-10-01 22:16:21,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:16:21,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14] total 41 [2019-10-01 22:16:21,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:16:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:16:21,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:16:21,606 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand 41 states. [2019-10-01 22:16:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:16:23,259 INFO L93 Difference]: Finished difference Result 478 states and 588 transitions. [2019-10-01 22:16:23,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-01 22:16:23,259 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2019-10-01 22:16:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:16:23,261 INFO L225 Difference]: With dead ends: 478 [2019-10-01 22:16:23,261 INFO L226 Difference]: Without dead ends: 360 [2019-10-01 22:16:23,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2054, Invalid=4108, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:16:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-01 22:16:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 197. [2019-10-01 22:16:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-01 22:16:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 225 transitions. [2019-10-01 22:16:23,283 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 225 transitions. Word has length 225 [2019-10-01 22:16:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:16:23,284 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 225 transitions. [2019-10-01 22:16:23,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:16:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 225 transitions. [2019-10-01 22:16:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-01 22:16:23,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:16:23,286 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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:16:23,286 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:16:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:16:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 439381993, now seen corresponding path program 22 times [2019-10-01 22:16:23,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:16:23,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:16:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:23,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:16:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:16:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1676 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-10-01 22:16:23,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:16:23,734 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:16:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:16:24,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:16:24,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:16:24,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:16:24,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:16:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1676 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-10-01 22:16:24,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:16:24,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:16:24,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:16:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:16:24,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:16:24,088 INFO L87 Difference]: Start difference. First operand 197 states and 225 transitions. Second operand 31 states. [2019-10-01 22:16:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:16:24,722 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2019-10-01 22:16:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:16:24,723 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 261 [2019-10-01 22:16:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:16:24,724 INFO L225 Difference]: With dead ends: 504 [2019-10-01 22:16:24,724 INFO L226 Difference]: Without dead ends: 368 [2019-10-01 22:16:24,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:16:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-10-01 22:16:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 199. [2019-10-01 22:16:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 22:16:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2019-10-01 22:16:24,745 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 261 [2019-10-01 22:16:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:16:24,745 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2019-10-01 22:16:24,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:16:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2019-10-01 22:16:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-01 22:16:24,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:16:24,748 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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:16:24,748 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:16:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:16:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash -92717817, now seen corresponding path program 23 times [2019-10-01 22:16:24,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:16:24,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:16:24,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:24,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:16:24,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:16:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:16:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-10-01 22:16:25,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:16:25,230 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:16:25,273 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:17:51,049 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 22:17:51,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:17:51,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:17:51,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:17:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1610 trivial. 0 not checked. [2019-10-01 22:17:51,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:17:51,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14] total 43 [2019-10-01 22:17:51,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:17:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:17:51,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=1251, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:17:51,523 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand 43 states. [2019-10-01 22:17:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:17:52,831 INFO L93 Difference]: Finished difference Result 528 states and 648 transitions. [2019-10-01 22:17:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:17:52,831 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 263 [2019-10-01 22:17:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:17:52,833 INFO L225 Difference]: With dead ends: 528 [2019-10-01 22:17:52,833 INFO L226 Difference]: Without dead ends: 392 [2019-10-01 22:17:52,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1071, Invalid=1899, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:17:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-01 22:17:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 210. [2019-10-01 22:17:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-01 22:17:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 240 transitions. [2019-10-01 22:17:52,858 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 240 transitions. Word has length 263 [2019-10-01 22:17:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:17:52,858 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 240 transitions. [2019-10-01 22:17:52,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:17:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 240 transitions. [2019-10-01 22:17:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-01 22:17:52,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:17:52,861 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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:17:52,861 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:17:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:17:52,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1750773092, now seen corresponding path program 24 times [2019-10-01 22:17:52,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:17:52,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:17:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:17:52,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:17:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:17:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:17:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2019-10-01 22:17:53,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:17:53,536 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:17:53,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:19:22,080 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:19:22,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:19:22,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:19:22,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:19:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2019-10-01 22:19:22,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:19:22,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 15] total 45 [2019-10-01 22:19:22,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:19:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:19:22,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1380, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:19:22,431 INFO L87 Difference]: Start difference. First operand 210 states and 240 transitions. Second operand 45 states. [2019-10-01 22:19:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:19:23,492 INFO L93 Difference]: Finished difference Result 554 states and 680 transitions. [2019-10-01 22:19:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:19:23,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 282 [2019-10-01 22:19:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:19:23,495 INFO L225 Difference]: With dead ends: 554 [2019-10-01 22:19:23,495 INFO L226 Difference]: Without dead ends: 409 [2019-10-01 22:19:23,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1185, Invalid=2121, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:19:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-01 22:19:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 221. [2019-10-01 22:19:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:19:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2019-10-01 22:19:23,520 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 282 [2019-10-01 22:19:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:19:23,520 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2019-10-01 22:19:23,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:19:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2019-10-01 22:19:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-01 22:19:23,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:19:23,523 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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:19:23,523 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:19:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:19:23,524 INFO L82 PathProgramCache]: Analyzing trace with hash 889881311, now seen corresponding path program 25 times [2019-10-01 22:19:23,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:19:23,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:19:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:23,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:19:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:19:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2240 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2019-10-01 22:19:24,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:19:24,182 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:19:24,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:19:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:19:24,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:19:24,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:19:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2240 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2019-10-01 22:19:24,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:19:24,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 22:19:24,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:19:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:19:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:19:24,449 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand 34 states. [2019-10-01 22:19:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:19:25,226 INFO L93 Difference]: Finished difference Result 564 states and 690 transitions. [2019-10-01 22:19:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:19:25,226 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 301 [2019-10-01 22:19:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:19:25,229 INFO L225 Difference]: With dead ends: 564 [2019-10-01 22:19:25,229 INFO L226 Difference]: Without dead ends: 410 [2019-10-01 22:19:25,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:19:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-01 22:19:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 223. [2019-10-01 22:19:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 22:19:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2019-10-01 22:19:25,256 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 301 [2019-10-01 22:19:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:19:25,256 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2019-10-01 22:19:25,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:19:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2019-10-01 22:19:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-01 22:19:25,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:19:25,272 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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:19:25,272 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:19:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:19:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash -360228355, now seen corresponding path program 26 times [2019-10-01 22:19:25,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:19:25,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:19:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:19:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:19:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2019-10-01 22:19:26,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:19:26,022 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:19:26,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:19:26,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:19:26,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:19:26,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:19:26,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:19:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2019-10-01 22:19:26,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:19:26,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:19:26,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:19:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:19:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:19:26,333 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 35 states. [2019-10-01 22:19:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:19:27,575 INFO L93 Difference]: Finished difference Result 572 states and 700 transitions. [2019-10-01 22:19:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:19:27,576 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 303 [2019-10-01 22:19:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:19:27,578 INFO L225 Difference]: With dead ends: 572 [2019-10-01 22:19:27,578 INFO L226 Difference]: Without dead ends: 418 [2019-10-01 22:19:27,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:19:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-01 22:19:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 225. [2019-10-01 22:19:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 22:19:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 257 transitions. [2019-10-01 22:19:27,609 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 257 transitions. Word has length 303 [2019-10-01 22:19:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:19:27,609 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 257 transitions. [2019-10-01 22:19:27,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:19:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 257 transitions. [2019-10-01 22:19:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-01 22:19:27,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:19:27,612 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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:19:27,612 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:19:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:19:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 875225499, now seen corresponding path program 27 times [2019-10-01 22:19:27,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:19:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:19:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:27,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:19:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:19:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2019-10-01 22:19:28,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:19:28,193 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:19:28,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:19:43,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:19:43,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:19:43,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:19:43,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:19:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2019-10-01 22:19:44,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:19:44,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 16] total 49 [2019-10-01 22:19:44,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:19:44,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:19:44,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=1638, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:19:44,205 INFO L87 Difference]: Start difference. First operand 225 states and 257 transitions. Second operand 49 states. [2019-10-01 22:19:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:19:45,561 INFO L93 Difference]: Finished difference Result 596 states and 732 transitions. [2019-10-01 22:19:45,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:19:45,562 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 305 [2019-10-01 22:19:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:19:45,564 INFO L225 Difference]: With dead ends: 596 [2019-10-01 22:19:45,564 INFO L226 Difference]: Without dead ends: 442 [2019-10-01 22:19:45,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 22:19:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-10-01 22:19:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 236. [2019-10-01 22:19:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-01 22:19:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 270 transitions. [2019-10-01 22:19:45,595 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 270 transitions. Word has length 305 [2019-10-01 22:19:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:19:45,596 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 270 transitions. [2019-10-01 22:19:45,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:19:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 270 transitions. [2019-10-01 22:19:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-01 22:19:45,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:19:45,598 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 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:19:45,598 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:19:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:19:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -563507576, now seen corresponding path program 28 times [2019-10-01 22:19:45,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:19:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:19:45,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:45,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:19:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:19:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2651 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2019-10-01 22:19:46,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:19:46,240 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:19:46,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:19:48,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:19:48,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:19:48,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:19:48,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:19:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2651 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2019-10-01 22:19:48,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:19:48,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 22:19:48,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:19:48,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:19:48,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:19:48,170 INFO L87 Difference]: Start difference. First operand 236 states and 270 transitions. Second operand 37 states. [2019-10-01 22:19:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:19:49,330 INFO L93 Difference]: Finished difference Result 606 states and 742 transitions. [2019-10-01 22:19:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:19:49,331 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 324 [2019-10-01 22:19:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:19:49,332 INFO L225 Difference]: With dead ends: 606 [2019-10-01 22:19:49,333 INFO L226 Difference]: Without dead ends: 443 [2019-10-01 22:19:49,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:19:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-01 22:19:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 238. [2019-10-01 22:19:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 22:19:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 272 transitions. [2019-10-01 22:19:49,369 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 272 transitions. Word has length 324 [2019-10-01 22:19:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:19:49,372 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 272 transitions. [2019-10-01 22:19:49,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:19:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 272 transitions. [2019-10-01 22:19:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-01 22:19:49,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:19:49,374 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 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:19:49,375 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:19:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:19:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1801874006, now seen corresponding path program 29 times [2019-10-01 22:19:49,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:19:49,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:19:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:49,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:19:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:19:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:19:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2718 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2019-10-01 22:19:50,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:19:50,044 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:19:50,100 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:21:56,007 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 22:21:56,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:21:56,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:21:56,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:21:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2718 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2019-10-01 22:21:56,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:21:56,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 22:21:56,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:21:56,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:21:56,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:21:56,183 INFO L87 Difference]: Start difference. First operand 238 states and 272 transitions. Second operand 38 states. [2019-10-01 22:21:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:21:57,391 INFO L93 Difference]: Finished difference Result 614 states and 752 transitions. [2019-10-01 22:21:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:21:57,392 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 326 [2019-10-01 22:21:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:21:57,394 INFO L225 Difference]: With dead ends: 614 [2019-10-01 22:21:57,394 INFO L226 Difference]: Without dead ends: 451 [2019-10-01 22:21:57,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:21:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-01 22:21:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 240. [2019-10-01 22:21:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-01 22:21:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 274 transitions. [2019-10-01 22:21:57,431 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 274 transitions. Word has length 326 [2019-10-01 22:21:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:21:57,431 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 274 transitions. [2019-10-01 22:21:57,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:21:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 274 transitions. [2019-10-01 22:21:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-01 22:21:57,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:21:57,434 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 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:21:57,434 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:21:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:21:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2128895052, now seen corresponding path program 30 times [2019-10-01 22:21:57,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:21:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:21:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:21:57,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:21:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:21:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:21:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2019-10-01 22:21:58,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:21:58,235 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:21:58,292 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:24:29,686 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 22:24:29,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:24:29,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:24:29,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:24:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 2136 trivial. 0 not checked. [2019-10-01 22:24:30,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:24:30,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 17] total 53 [2019-10-01 22:24:30,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:24:30,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:24:30,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=1918, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:24:30,139 INFO L87 Difference]: Start difference. First operand 240 states and 274 transitions. Second operand 53 states. [2019-10-01 22:24:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:24:31,820 INFO L93 Difference]: Finished difference Result 638 states and 784 transitions. [2019-10-01 22:24:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:24:31,821 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 328 [2019-10-01 22:24:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:24:31,823 INFO L225 Difference]: With dead ends: 638 [2019-10-01 22:24:31,823 INFO L226 Difference]: Without dead ends: 475 [2019-10-01 22:24:31,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1633, Invalid=2923, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:24:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-01 22:24:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 251. [2019-10-01 22:24:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-01 22:24:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2019-10-01 22:24:31,863 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 328 [2019-10-01 22:24:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:24:31,863 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2019-10-01 22:24:31,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:24:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2019-10-01 22:24:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-10-01 22:24:31,866 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:24:31,866 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 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:24:31,866 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:24:31,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:24:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1406948817, now seen corresponding path program 31 times [2019-10-01 22:24:31,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:24:31,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:24:31,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:24:31,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:24:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:24:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:24:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3097 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-10-01 22:24:32,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:24:32,549 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:24:32,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:24:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:24:32,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 22:24:32,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:24:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3097 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-10-01 22:24:32,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:24:32,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-01 22:24:32,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:24:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:24:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:24:32,923 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand 40 states. [2019-10-01 22:24:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:24:34,411 INFO L93 Difference]: Finished difference Result 648 states and 794 transitions. [2019-10-01 22:24:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 22:24:34,411 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 347 [2019-10-01 22:24:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:24:34,413 INFO L225 Difference]: With dead ends: 648 [2019-10-01 22:24:34,414 INFO L226 Difference]: Without dead ends: 476 [2019-10-01 22:24:34,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:24:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-01 22:24:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 253. [2019-10-01 22:24:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-01 22:24:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 289 transitions. [2019-10-01 22:24:34,458 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 289 transitions. Word has length 347 [2019-10-01 22:24:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:24:34,458 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 289 transitions. [2019-10-01 22:24:34,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:24:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 289 transitions. [2019-10-01 22:24:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-01 22:24:34,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:24:34,461 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 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:24:34,461 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:24:34,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:24:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2096055091, now seen corresponding path program 32 times [2019-10-01 22:24:34,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:24:34,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:24:34,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:24:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:24:34,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:24:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:24:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3170 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-10-01 22:24:35,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:24:35,353 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:24:35,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:24:35,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:24:35,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:24:35,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:24:35,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:24:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3170 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-10-01 22:24:35,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:24:35,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:24:35,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:24:35,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:24:35,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:24:35,725 INFO L87 Difference]: Start difference. First operand 253 states and 289 transitions. Second operand 41 states. [2019-10-01 22:24:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:24:37,375 INFO L93 Difference]: Finished difference Result 656 states and 804 transitions. [2019-10-01 22:24:37,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:24:37,375 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 349 [2019-10-01 22:24:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:24:37,377 INFO L225 Difference]: With dead ends: 656 [2019-10-01 22:24:37,378 INFO L226 Difference]: Without dead ends: 484 [2019-10-01 22:24:37,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:24:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-10-01 22:24:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 255. [2019-10-01 22:24:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-01 22:24:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2019-10-01 22:24:37,426 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 349 [2019-10-01 22:24:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:24:37,427 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2019-10-01 22:24:37,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:24:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2019-10-01 22:24:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-01 22:24:37,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:24:37,430 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 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:24:37,430 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:24:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:24:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1392746475, now seen corresponding path program 33 times [2019-10-01 22:24:37,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:24:37,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:24:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:24:37,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:24:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:24:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:24:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3245 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-10-01 22:24:38,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:24:38,464 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:24:38,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:25:20,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:25:20,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:25:20,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:25:20,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:25:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3245 backedges. 75 proven. 225 refuted. 0 times theorem prover too weak. 2945 trivial. 0 not checked. [2019-10-01 22:25:21,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:25:21,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20] total 59 [2019-10-01 22:25:21,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:25:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:25:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2367, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:25:21,073 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand 59 states. [2019-10-01 22:25:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:25:23,806 INFO L93 Difference]: Finished difference Result 693 states and 854 transitions. [2019-10-01 22:25:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:25:23,807 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 351 [2019-10-01 22:25:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:25:23,809 INFO L225 Difference]: With dead ends: 693 [2019-10-01 22:25:23,809 INFO L226 Difference]: Without dead ends: 521 [2019-10-01 22:25:23,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1999, Invalid=3551, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:25:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-10-01 22:25:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 268. [2019-10-01 22:25:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-01 22:25:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2019-10-01 22:25:23,863 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 351 [2019-10-01 22:25:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:25:23,863 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2019-10-01 22:25:23,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:25:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2019-10-01 22:25:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-10-01 22:25:23,866 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:25:23,867 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 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:25:23,867 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:25:23,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:25:23,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1896834342, now seen corresponding path program 34 times [2019-10-01 22:25:23,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:25:23,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:25:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:25:23,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:25:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:25:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:25:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3657 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2057 trivial. 0 not checked. [2019-10-01 22:25:24,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:25:24,690 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:25:24,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:25:25,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:25:25,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:25:25,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 22:25:25,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:25:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3657 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2057 trivial. 0 not checked. [2019-10-01 22:25:25,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:25:25,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 22:25:25,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:25:25,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:25:25,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:25:25,365 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand 44 states. [2019-10-01 22:25:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:25:27,213 INFO L93 Difference]: Finished difference Result 698 states and 856 transitions. [2019-10-01 22:25:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:25:27,213 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 372 [2019-10-01 22:25:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:25:27,215 INFO L225 Difference]: With dead ends: 698 [2019-10-01 22:25:27,215 INFO L226 Difference]: Without dead ends: 517 [2019-10-01 22:25:27,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:25:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-10-01 22:25:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 270. [2019-10-01 22:25:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-01 22:25:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 308 transitions. [2019-10-01 22:25:27,282 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 308 transitions. Word has length 372 [2019-10-01 22:25:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:25:27,283 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 308 transitions. [2019-10-01 22:25:27,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:25:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 308 transitions. [2019-10-01 22:25:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-01 22:25:27,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:25:27,287 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 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:25:27,287 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:25:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:25:27,287 INFO L82 PathProgramCache]: Analyzing trace with hash -660793860, now seen corresponding path program 35 times [2019-10-01 22:25:27,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:25:27,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:25:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:25:27,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:25:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:25:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:25:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3738 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 2057 trivial. 0 not checked. [2019-10-01 22:25:28,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:25:28,148 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:25:28,228 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:27:56,375 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 22:27:56,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:27:56,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:27:56,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:27:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3738 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2019-10-01 22:27:57,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:27:57,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 19] total 61 [2019-10-01 22:27:57,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:27:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:27:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=2544, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:27:57,085 INFO L87 Difference]: Start difference. First operand 270 states and 308 transitions. Second operand 61 states. [2019-10-01 22:27:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:27:59,721 INFO L93 Difference]: Finished difference Result 722 states and 888 transitions. [2019-10-01 22:27:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:27:59,721 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 374 [2019-10-01 22:27:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:27:59,723 INFO L225 Difference]: With dead ends: 722 [2019-10-01 22:27:59,724 INFO L226 Difference]: Without dead ends: 541 [2019-10-01 22:27:59,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2153, Invalid=3853, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 22:27:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-01 22:27:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 281. [2019-10-01 22:27:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-01 22:27:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 321 transitions. [2019-10-01 22:27:59,796 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 321 transitions. Word has length 374 [2019-10-01 22:27:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:27:59,797 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 321 transitions. [2019-10-01 22:27:59,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:27:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 321 transitions. [2019-10-01 22:27:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-01 22:27:59,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:27:59,800 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 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:27:59,800 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:27:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:27:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash -797908609, now seen corresponding path program 36 times [2019-10-01 22:27:59,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:27:59,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:27:59,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:27:59,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:27:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:27:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4094 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 2330 trivial. 0 not checked. [2019-10-01 22:28:01,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:01,340 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE