java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcmp_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:39:31,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:39:31,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:39:31,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:39:31,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:39:31,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:39:31,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:39:31,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:39:31,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:39:31,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:39:31,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:39:31,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:39:31,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:39:31,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:39:31,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:39:31,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:39:31,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:39:31,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:39:31,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:39:31,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:39:31,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:39:31,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:39:31,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:39:31,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:39:31,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:39:31,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:39:31,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:39:31,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:39:31,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:39:31,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:39:31,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:39:31,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:39:31,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:39:31,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:39:31,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:39:31,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:39:31,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:39:31,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:39:31,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:39:31,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:39:31,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:39:31,468 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 23:39:31,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:39:31,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:39:31,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:39:31,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:39:31,498 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:39:31,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:39:31,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:39:31,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:39:31,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:39:31,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:39:31,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:39:31,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:39:31,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:39:31,502 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:39:31,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:39:31,503 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:39:31,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:39:31,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:39:31,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:39:31,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:39:31,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:39:31,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:39:31,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:39:31,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:39:31,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:39:31,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:39:31,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:39:31,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:39:31,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:39:31,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:39:31,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:39:31,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:39:31,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:39:31,591 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:39:31,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcmp_ground.i [2019-10-01 23:39:31,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564ec4c75/36d6690a287144b6be4a9eb24ea58839/FLAGdc3a2ca5b [2019-10-01 23:39:32,132 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:39:32,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcmp_ground.i [2019-10-01 23:39:32,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564ec4c75/36d6690a287144b6be4a9eb24ea58839/FLAGdc3a2ca5b [2019-10-01 23:39:32,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564ec4c75/36d6690a287144b6be4a9eb24ea58839 [2019-10-01 23:39:32,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:39:32,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:39:32,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:39:32,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:39:32,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:39:32,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:32,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65342265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32, skipping insertion in model container [2019-10-01 23:39:32,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:32,554 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:39:32,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:39:32,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:39:32,801 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:39:32,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:39:32,937 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:39:32,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32 WrapperNode [2019-10-01 23:39:32,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:39:32,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:39:32,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:39:32,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:39:32,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:32,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:32,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:32,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:32,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:32,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:33,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... [2019-10-01 23:39:33,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:39:33,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:39:33,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:39:33,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:39:33,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:39:33,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:39:33,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:39:33,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:39:33,095 INFO L138 BoogieDeclarations]: Found implementation of procedure _strcmp [2019-10-01 23:39:33,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure _strcmp [2019-10-01 23:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:39:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:39:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:39:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:39:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:39:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:39:33,438 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:39:33,438 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:39:33,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:39:33 BoogieIcfgContainer [2019-10-01 23:39:33,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:39:33,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:39:33,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:39:33,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:39:33,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:39:32" (1/3) ... [2019-10-01 23:39:33,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558a17f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:39:33, skipping insertion in model container [2019-10-01 23:39:33,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:39:32" (2/3) ... [2019-10-01 23:39:33,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558a17f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:39:33, skipping insertion in model container [2019-10-01 23:39:33,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:39:33" (3/3) ... [2019-10-01 23:39:33,458 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcmp_ground.i [2019-10-01 23:39:33,470 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:39:33,481 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:39:33,497 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:39:33,525 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:39:33,526 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:39:33,527 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:39:33,527 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:39:33,527 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:39:33,527 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:39:33,528 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:39:33,528 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:39:33,528 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:39:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-01 23:39:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:39:33,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:33,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:33,559 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:33,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash 893293776, now seen corresponding path program 1 times [2019-10-01 23:39:33,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:33,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:33,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:33,716 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 23:39:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:39:33,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:39:33,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:39:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:39:33,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:39:33,736 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-01 23:39:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:33,760 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2019-10-01 23:39:33,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:39:33,761 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-10-01 23:39:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:33,768 INFO L225 Difference]: With dead ends: 56 [2019-10-01 23:39:33,769 INFO L226 Difference]: Without dead ends: 27 [2019-10-01 23:39:33,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:39:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-01 23:39:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-01 23:39:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 23:39:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-01 23:39:33,815 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-10-01 23:39:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:33,816 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-01 23:39:33,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:39:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-01 23:39:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:39:33,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:33,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:33,818 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash -368321770, now seen corresponding path program 1 times [2019-10-01 23:39:33,819 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:33,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:33,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:33,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:33,892 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 23:39:33,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:39:33,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:39:33,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:39:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:39:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:39:33,899 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2019-10-01 23:39:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:33,953 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-01 23:39:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:39:33,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-01 23:39:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:33,955 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:39:33,956 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 23:39:33,957 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 23:39:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 23:39:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 23:39:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:39:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-01 23:39:33,965 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2019-10-01 23:39:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:33,965 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-01 23:39:33,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:39:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-01 23:39:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 23:39:33,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:33,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:33,967 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash -967109544, now seen corresponding path program 1 times [2019-10-01 23:39:33,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:33,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:33,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:33,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:39:34,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:39:34,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:39:34,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:39:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:39:34,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:39:34,084 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2019-10-01 23:39:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:34,114 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-10-01 23:39:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:39:34,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-01 23:39:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:34,118 INFO L225 Difference]: With dead ends: 47 [2019-10-01 23:39:34,119 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 23:39:34,119 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 23:39:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 23:39:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-10-01 23:39:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:39:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-01 23:39:34,127 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2019-10-01 23:39:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:34,127 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-01 23:39:34,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:39:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-01 23:39:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 23:39:34,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:34,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:34,129 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash 716522559, now seen corresponding path program 1 times [2019-10-01 23:39:34,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:34,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:39:34,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:39:34,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-01 23:39:34,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:39:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:39:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:39:34,245 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2019-10-01 23:39:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:34,270 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-10-01 23:39:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:39:34,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-01 23:39:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:34,276 INFO L225 Difference]: With dead ends: 43 [2019-10-01 23:39:34,276 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 23:39:34,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:39:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 23:39:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-01 23:39:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:39:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-01 23:39:34,283 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2019-10-01 23:39:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:34,283 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-01 23:39:34,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:39:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-01 23:39:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 23:39:34,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:34,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:34,285 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash 487231732, now seen corresponding path program 1 times [2019-10-01 23:39:34,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:34,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:34,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:39:34,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:34,346 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 23:39:34,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:34,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:39:34,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:39:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:34,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:39:34,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:39:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:39:34,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:39:34,478 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2019-10-01 23:39:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:34,536 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-10-01 23:39:34,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:39:34,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-01 23:39:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:34,539 INFO L225 Difference]: With dead ends: 52 [2019-10-01 23:39:34,539 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 23:39:34,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 23:39:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 23:39:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 23:39:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 23:39:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-01 23:39:34,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2019-10-01 23:39:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:34,548 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-01 23:39:34,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:39:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-01 23:39:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-01 23:39:34,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:34,549 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:34,550 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:34,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1622628662, now seen corresponding path program 2 times [2019-10-01 23:39:34,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:34,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:34,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:34,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:39:34,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:34,623 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 23:39:34,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:39:34,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:39:34,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:34,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:39:34,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:39:34,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:34,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:39:34,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:39:34,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:39:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:39:34,748 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2019-10-01 23:39:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:34,777 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-10-01 23:39:34,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:39:34,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-01 23:39:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:34,779 INFO L225 Difference]: With dead ends: 54 [2019-10-01 23:39:34,779 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 23:39:34,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:39:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 23:39:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 23:39:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 23:39:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-01 23:39:34,792 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2019-10-01 23:39:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:34,792 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-01 23:39:34,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:39:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-01 23:39:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-01 23:39:34,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:34,794 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] [2019-10-01 23:39:34,794 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:34,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1817385208, now seen corresponding path program 3 times [2019-10-01 23:39:34,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:34,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:34,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:39:34,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:34,907 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:39:34,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:34,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 23:39:34,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:34,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:39:34,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:39:34,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:34,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 23:39:34,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:39:34,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:39:34,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:39:34,993 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2019-10-01 23:39:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:35,049 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-01 23:39:35,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:39:35,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-10-01 23:39:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:35,050 INFO L225 Difference]: With dead ends: 59 [2019-10-01 23:39:35,050 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 23:39:35,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:39:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 23:39:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 23:39:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 23:39:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-01 23:39:35,057 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 28 [2019-10-01 23:39:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:35,058 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-01 23:39:35,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:39:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-01 23:39:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 23:39:35,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:35,059 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:35,059 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2036726870, now seen corresponding path program 4 times [2019-10-01 23:39:35,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:35,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:35,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:35,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 23:39:35,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:35,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 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 23:39:35,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:39:35,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:39:35,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:35,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:39:35,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 23:39:35,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:35,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:39:35,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:39:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:39:35,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:39:35,289 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2019-10-01 23:39:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:35,360 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-10-01 23:39:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:39:35,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-10-01 23:39:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:35,362 INFO L225 Difference]: With dead ends: 62 [2019-10-01 23:39:35,362 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 23:39:35,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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 23:39:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 23:39:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 23:39:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 23:39:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-01 23:39:35,373 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 32 [2019-10-01 23:39:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:35,375 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-01 23:39:35,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:39:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-01 23:39:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 23:39:35,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:35,379 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:35,379 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 24076952, now seen corresponding path program 5 times [2019-10-01 23:39:35,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:35,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:35,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 23:39:35,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:35,511 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:35,540 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:39:35,606 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 23:39:35,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:35,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:39:35,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 23:39:35,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:35,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 23:39:35,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:39:35,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:39:35,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:39:35,650 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2019-10-01 23:39:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:35,713 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-10-01 23:39:35,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:39:35,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-10-01 23:39:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:35,715 INFO L225 Difference]: With dead ends: 67 [2019-10-01 23:39:35,715 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 23:39:35,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:39:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 23:39:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 23:39:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 23:39:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-01 23:39:35,722 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 34 [2019-10-01 23:39:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:35,722 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-01 23:39:35,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:39:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-01 23:39:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:39:35,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:35,724 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:35,724 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:35,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash -523451274, now seen corresponding path program 6 times [2019-10-01 23:39:35,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:35,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:35,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:35,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:35,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:39:35,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:35,826 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 23:39:35,857 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:39:35,914 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 23:39:35,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:35,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:39:35,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:35,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:39:35,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:39:36,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:39:36,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:39:36,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:39:36,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:39:36,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:39:36,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:39:36,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:39:36,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:39:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 23:39:36,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:36,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2019-10-01 23:39:36,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:39:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:39:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:39:36,252 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 18 states. [2019-10-01 23:39:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:36,659 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-10-01 23:39:36,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:39:36,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-10-01 23:39:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:36,660 INFO L225 Difference]: With dead ends: 78 [2019-10-01 23:39:36,661 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 23:39:36,662 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:39:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 23:39:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-10-01 23:39:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 23:39:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-10-01 23:39:36,669 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2019-10-01 23:39:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:36,670 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-10-01 23:39:36,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:39:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-10-01 23:39:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-01 23:39:36,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:36,671 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 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 23:39:36,671 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1822920504, now seen corresponding path program 1 times [2019-10-01 23:39:36,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:36,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:36,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-01 23:39:36,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:36,772 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:39:36,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:36,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:39:36,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 23:39:36,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:36,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:39:36,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:39:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:39:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:39:36,881 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 11 states. [2019-10-01 23:39:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:36,929 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-10-01 23:39:36,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:39:36,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-10-01 23:39:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:36,931 INFO L225 Difference]: With dead ends: 84 [2019-10-01 23:39:36,931 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 23:39:36,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 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 23:39:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 23:39:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-01 23:39:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 23:39:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-01 23:39:36,940 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2019-10-01 23:39:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:36,941 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-01 23:39:36,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:39:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-01 23:39:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-01 23:39:36,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:36,942 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 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 23:39:36,942 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1671500554, now seen corresponding path program 2 times [2019-10-01 23:39:36,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:36,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:36,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:36,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:39:36,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-01 23:39:37,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:37,100 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 23:39:37,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:39:37,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:39:37,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:37,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:39:37,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:39:37,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:37,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:39:37,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:39:37,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:39:37,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:39:37,218 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 12 states. [2019-10-01 23:39:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:37,271 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-10-01 23:39:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:39:37,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-01 23:39:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:37,274 INFO L225 Difference]: With dead ends: 86 [2019-10-01 23:39:37,274 INFO L226 Difference]: Without dead ends: 56 [2019-10-01 23:39:37,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 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 23:39:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-01 23:39:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-01 23:39:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 23:39:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-10-01 23:39:37,289 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2019-10-01 23:39:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:37,293 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-10-01 23:39:37,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:39:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-10-01 23:39:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-01 23:39:37,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:37,296 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 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 23:39:37,296 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:37,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1145711820, now seen corresponding path program 3 times [2019-10-01 23:39:37,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:37,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:37,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:37,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-01 23:39:37,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:37,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:37,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:39:37,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 23:39:37,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:37,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:39:37,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-01 23:39:37,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:37,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2019-10-01 23:39:37,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:39:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:39:37,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:39:37,578 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 16 states. [2019-10-01 23:39:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:37,670 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-10-01 23:39:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:39:37,671 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-10-01 23:39:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:37,672 INFO L225 Difference]: With dead ends: 91 [2019-10-01 23:39:37,672 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:39:37,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:39:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:39:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 23:39:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 23:39:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-01 23:39:37,686 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 52 [2019-10-01 23:39:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:37,686 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-01 23:39:37,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:39:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-01 23:39:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 23:39:37,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:37,687 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 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 23:39:37,687 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash -213316310, now seen corresponding path program 4 times [2019-10-01 23:39:37,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:37,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:37,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:37,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:39:37,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:37,834 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 23:39:37,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:39:37,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:39:37,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:37,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:39:37,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:37,928 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 23:39:37,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:39:37,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:39:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:39:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:39:37,945 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 14 states. [2019-10-01 23:39:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:38,008 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-10-01 23:39:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:39:38,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-10-01 23:39:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:38,010 INFO L225 Difference]: With dead ends: 94 [2019-10-01 23:39:38,010 INFO L226 Difference]: Without dead ends: 62 [2019-10-01 23:39:38,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:39:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-01 23:39:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-10-01 23:39:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 23:39:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-01 23:39:38,017 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 56 [2019-10-01 23:39:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:38,018 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-01 23:39:38,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:39:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-01 23:39:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-01 23:39:38,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:38,019 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 4, 4, 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 23:39:38,019 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:38,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2089530004, now seen corresponding path program 5 times [2019-10-01 23:39:38,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:38,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:38,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:38,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:38,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:39:38,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:38,232 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:39:38,265 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:38,746 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 23:39:38,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:38,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:39:38,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-01 23:39:38,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:38,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 23:39:38,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:39:38,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:39:38,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:39:38,844 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2019-10-01 23:39:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:38,936 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-10-01 23:39:38,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:39:38,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-10-01 23:39:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:38,938 INFO L225 Difference]: With dead ends: 99 [2019-10-01 23:39:38,938 INFO L226 Difference]: Without dead ends: 67 [2019-10-01 23:39:38,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:39:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-01 23:39:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-10-01 23:39:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 23:39:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-10-01 23:39:38,945 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 58 [2019-10-01 23:39:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:38,945 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-10-01 23:39:38,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:39:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-10-01 23:39:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 23:39:38,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:38,946 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 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 23:39:38,946 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1299737674, now seen corresponding path program 6 times [2019-10-01 23:39:38,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:38,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:38,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 2 proven. 144 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 23:39:39,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:39,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:39,122 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:39:39,263 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 23:39:39,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:39,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:39:39,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:39,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:39:39,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:39:39,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:39:39,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:39:39,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:39:41,488 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 4) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 4)))) is different from true [2019-10-01 23:39:43,533 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-01 23:39:45,566 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-01 23:39:45,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:39:45,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:39:45,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:39:45,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:39:45,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:39:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 153 trivial. 1 not checked. [2019-10-01 23:39:47,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:47,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-10-01 23:39:47,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:39:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:39:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=620, Unknown=2, NotChecked=52, Total=812 [2019-10-01 23:39:47,789 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 29 states. [2019-10-01 23:39:50,475 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:39:56,659 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-10-01 23:40:00,713 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-01 23:40:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:02,795 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2019-10-01 23:40:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:40:02,795 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-10-01 23:40:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:02,797 INFO L225 Difference]: With dead ends: 112 [2019-10-01 23:40:02,797 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 23:40:02,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=378, Invalid=1785, Unknown=3, NotChecked=90, Total=2256 [2019-10-01 23:40:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 23:40:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-10-01 23:40:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 23:40:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2019-10-01 23:40:02,805 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2019-10-01 23:40:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:02,806 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2019-10-01 23:40:02,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:40:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2019-10-01 23:40:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 23:40:02,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:02,807 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:02,807 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 620060316, now seen corresponding path program 7 times [2019-10-01 23:40:02,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:02,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:02,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:02,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:02,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 23:40:03,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:03,001 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:03,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:03,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:40:03,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-01 23:40:03,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:03,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:40:03,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:40:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:40:03,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:40:03,119 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 17 states. [2019-10-01 23:40:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:03,190 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-10-01 23:40:03,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:40:03,191 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-10-01 23:40:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:03,192 INFO L225 Difference]: With dead ends: 120 [2019-10-01 23:40:03,192 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 23:40:03,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 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 23:40:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 23:40:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 23:40:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 23:40:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-01 23:40:03,202 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2019-10-01 23:40:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:03,203 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-01 23:40:03,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:40:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-01 23:40:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 23:40:03,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:03,211 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:03,211 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:03,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1114364638, now seen corresponding path program 8 times [2019-10-01 23:40:03,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:03,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:03,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 4 proven. 196 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 23:40:03,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:03,461 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:03,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:03,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:03,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:03,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:40:03,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-01 23:40:03,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:03,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:40:03,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:40:03,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:40:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:40:03,592 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 18 states. [2019-10-01 23:40:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:03,672 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2019-10-01 23:40:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:40:03,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2019-10-01 23:40:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:03,673 INFO L225 Difference]: With dead ends: 122 [2019-10-01 23:40:03,674 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:40:03,674 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:40:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:40:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-10-01 23:40:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:40:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-10-01 23:40:03,688 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2019-10-01 23:40:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:03,688 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-10-01 23:40:03,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:40:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-10-01 23:40:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 23:40:03,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:03,689 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:03,689 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:03,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:03,690 INFO L82 PathProgramCache]: Analyzing trace with hash -600551776, now seen corresponding path program 9 times [2019-10-01 23:40:03,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:03,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:03,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:03,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:03,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 4 proven. 225 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 23:40:03,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:03,913 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:03,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:40:03,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:40:03,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:04,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:40:04,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:40:04,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:04,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 23:40:04,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:40:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:40:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:40:04,100 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 24 states. [2019-10-01 23:40:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:04,232 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-10-01 23:40:04,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:40:04,233 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2019-10-01 23:40:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:04,234 INFO L225 Difference]: With dead ends: 127 [2019-10-01 23:40:04,235 INFO L226 Difference]: Without dead ends: 85 [2019-10-01 23:40:04,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:40:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-01 23:40:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-10-01 23:40:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-01 23:40:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-10-01 23:40:04,241 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 76 [2019-10-01 23:40:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:04,241 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-10-01 23:40:04,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:40:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-10-01 23:40:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-01 23:40:04,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:04,242 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:04,243 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:04,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1512199170, now seen corresponding path program 10 times [2019-10-01 23:40:04,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:04,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:04,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:04,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:04,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 4 proven. 256 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-01 23:40:04,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:04,498 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:04,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:40:04,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:40:04,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:04,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:40:04,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:40:04,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:04,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:40:04,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:40:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:40:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:40:04,604 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 20 states. [2019-10-01 23:40:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:04,677 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2019-10-01 23:40:04,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:40:04,677 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2019-10-01 23:40:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:04,678 INFO L225 Difference]: With dead ends: 130 [2019-10-01 23:40:04,679 INFO L226 Difference]: Without dead ends: 86 [2019-10-01 23:40:04,679 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 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 23:40:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-01 23:40:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-10-01 23:40:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 23:40:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2019-10-01 23:40:04,686 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 80 [2019-10-01 23:40:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:04,686 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2019-10-01 23:40:04,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:40:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2019-10-01 23:40:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-01 23:40:04,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:04,688 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:04,688 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1287439936, now seen corresponding path program 11 times [2019-10-01 23:40:04,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:04,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 4 proven. 289 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-01 23:40:04,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:04,949 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:04,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:40:12,037 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 23:40:12,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:12,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:40:12,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2019-10-01 23:40:12,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:12,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 23:40:12,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:40:12,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:40:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:40:12,203 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 27 states. [2019-10-01 23:40:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:12,344 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-10-01 23:40:12,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:40:12,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2019-10-01 23:40:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:12,345 INFO L225 Difference]: With dead ends: 135 [2019-10-01 23:40:12,345 INFO L226 Difference]: Without dead ends: 91 [2019-10-01 23:40:12,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:40:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-01 23:40:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-10-01 23:40:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 23:40:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-10-01 23:40:12,351 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 82 [2019-10-01 23:40:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:12,352 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-10-01 23:40:12,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:40:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-10-01 23:40:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-01 23:40:12,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:12,353 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:12,353 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:12,353 INFO L82 PathProgramCache]: Analyzing trace with hash -762961378, now seen corresponding path program 12 times [2019-10-01 23:40:12,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:12,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:12,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:12,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 4 proven. 324 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-01 23:40:12,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:12,620 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:12,655 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:40:14,511 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:40:14,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:14,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 23:40:14,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:14,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:40:14,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:14,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:14,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:14,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:40:16,750 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|)))) is different from true [2019-10-01 23:40:18,838 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) 8) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 8)))) is different from true [2019-10-01 23:40:20,901 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-01 23:40:22,949 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-01 23:40:23,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:40:23,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:23,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:23,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:23,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:40:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 340 trivial. 7 not checked. [2019-10-01 23:40:25,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:25,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2019-10-01 23:40:25,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:40:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:40:25,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1014, Unknown=3, NotChecked=138, Total=1406 [2019-10-01 23:40:25,209 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 38 states. [2019-10-01 23:40:28,246 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:40:34,435 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-10-01 23:40:38,534 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-01 23:40:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:40,648 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2019-10-01 23:40:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:40:40,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-10-01 23:40:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:40,653 INFO L225 Difference]: With dead ends: 148 [2019-10-01 23:40:40,653 INFO L226 Difference]: Without dead ends: 102 [2019-10-01 23:40:40,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=701, Invalid=2963, Unknown=4, NotChecked=238, Total=3906 [2019-10-01 23:40:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-01 23:40:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2019-10-01 23:40:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 23:40:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-10-01 23:40:40,663 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 86 [2019-10-01 23:40:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:40,663 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-10-01 23:40:40,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:40:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-10-01 23:40:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 23:40:40,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:40,664 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:40,665 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 840456816, now seen corresponding path program 13 times [2019-10-01 23:40:40,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:40,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:40,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:40,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:40,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 6 proven. 361 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-01 23:40:40,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:40,919 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:41,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:40:41,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-01 23:40:41,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:41,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:40:41,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:40:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:40:41,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:40:41,036 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 23 states. [2019-10-01 23:40:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:41,115 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2019-10-01 23:40:41,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:40:41,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2019-10-01 23:40:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:41,117 INFO L225 Difference]: With dead ends: 156 [2019-10-01 23:40:41,117 INFO L226 Difference]: Without dead ends: 102 [2019-10-01 23:40:41,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 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 23:40:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-01 23:40:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-10-01 23:40:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-01 23:40:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-10-01 23:40:41,124 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 96 [2019-10-01 23:40:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:41,125 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-10-01 23:40:41,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:40:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-10-01 23:40:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 23:40:41,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:41,126 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:41,126 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1196339378, now seen corresponding path program 14 times [2019-10-01 23:40:41,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 6 proven. 400 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-01 23:40:41,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:41,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:41,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:41,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:41,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:41,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:40:41,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-01 23:40:41,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:41,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:40:41,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:40:41,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:40:41,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:40:41,604 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 24 states. [2019-10-01 23:40:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:41,702 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-10-01 23:40:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:40:41,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2019-10-01 23:40:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:41,704 INFO L225 Difference]: With dead ends: 158 [2019-10-01 23:40:41,704 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 23:40:41,705 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:40:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 23:40:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-10-01 23:40:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 23:40:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2019-10-01 23:40:41,711 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 98 [2019-10-01 23:40:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:41,711 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2019-10-01 23:40:41,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:40:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2019-10-01 23:40:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 23:40:41,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:41,713 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:41,713 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash -397902220, now seen corresponding path program 15 times [2019-10-01 23:40:41,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:41,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:41,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 6 proven. 441 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-01 23:40:42,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:42,017 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:42,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:40:42,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-01 23:40:42,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:42,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:40:42,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-01 23:40:42,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:42,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 32 [2019-10-01 23:40:42,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:40:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:40:42,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:40:42,243 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 32 states. [2019-10-01 23:40:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:42,454 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2019-10-01 23:40:42,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:40:42,454 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2019-10-01 23:40:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:42,456 INFO L225 Difference]: With dead ends: 163 [2019-10-01 23:40:42,456 INFO L226 Difference]: Without dead ends: 109 [2019-10-01 23:40:42,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:40:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-01 23:40:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-10-01 23:40:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 23:40:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-10-01 23:40:42,464 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 100 [2019-10-01 23:40:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:42,464 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-10-01 23:40:42,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:40:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-10-01 23:40:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-01 23:40:42,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:42,466 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:42,466 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash -979707694, now seen corresponding path program 16 times [2019-10-01 23:40:42,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:42,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:42,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:42,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 6 proven. 484 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-01 23:40:42,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:42,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:42,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:40:42,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:40:42,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:42,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:40:42,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 23:40:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:40:42,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:40:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:40:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:40:42,956 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 26 states. [2019-10-01 23:40:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:43,047 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-10-01 23:40:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:40:43,048 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2019-10-01 23:40:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:43,049 INFO L225 Difference]: With dead ends: 166 [2019-10-01 23:40:43,049 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 23:40:43,050 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:40:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 23:40:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-10-01 23:40:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 23:40:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-10-01 23:40:43,056 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 104 [2019-10-01 23:40:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:43,056 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-10-01 23:40:43,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:40:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-10-01 23:40:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 23:40:43,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:43,058 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:43,058 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2076167444, now seen corresponding path program 17 times [2019-10-01 23:40:43,058 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:43,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-01 23:40:43,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:43,392 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:43,426 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:41:49,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 23:41:49,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:49,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:41:49,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 23:41:49,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:49,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:41:49,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:41:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:41:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:41:49,416 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 27 states. [2019-10-01 23:41:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:49,540 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2019-10-01 23:41:49,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:41:49,547 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2019-10-01 23:41:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:49,548 INFO L225 Difference]: With dead ends: 168 [2019-10-01 23:41:49,548 INFO L226 Difference]: Without dead ends: 112 [2019-10-01 23:41:49,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:41:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-01 23:41:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-10-01 23:41:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 23:41:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2019-10-01 23:41:49,555 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 106 [2019-10-01 23:41:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:49,555 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2019-10-01 23:41:49,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:41:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2019-10-01 23:41:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 23:41:49,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:49,557 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:49,557 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1014544598, now seen corresponding path program 18 times [2019-10-01 23:41:49,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:49,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:49,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 6 proven. 576 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-01 23:41:50,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:50,062 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 23:41:50,109 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:41:51,030 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-01 23:41:51,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:51,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:41:51,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-10-01 23:41:51,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:51,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 36 [2019-10-01 23:41:51,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:41:51,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:41:51,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:41:51,189 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 36 states. [2019-10-01 23:41:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:51,378 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2019-10-01 23:41:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:41:51,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 108 [2019-10-01 23:41:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:51,381 INFO L225 Difference]: With dead ends: 173 [2019-10-01 23:41:51,381 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 23:41:51,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:41:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 23:41:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 23:41:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 23:41:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-10-01 23:41:51,388 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 108 [2019-10-01 23:41:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:51,388 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-10-01 23:41:51,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:41:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-10-01 23:41:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-01 23:41:51,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:51,390 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:51,390 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1650057036, now seen corresponding path program 19 times [2019-10-01 23:41:51,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:51,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:51,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 6 proven. 625 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-01 23:41:51,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:51,929 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 23:41:52,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:52,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:41:52,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-01 23:41:52,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:52,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:41:52,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:41:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:41:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:41:52,169 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 29 states. [2019-10-01 23:41:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:52,295 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2019-10-01 23:41:52,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:41:52,296 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 112 [2019-10-01 23:41:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:52,297 INFO L225 Difference]: With dead ends: 176 [2019-10-01 23:41:52,297 INFO L226 Difference]: Without dead ends: 118 [2019-10-01 23:41:52,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 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 23:41:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-01 23:41:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-10-01 23:41:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 23:41:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-10-01 23:41:52,310 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 112 [2019-10-01 23:41:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:52,311 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-10-01 23:41:52,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:41:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-10-01 23:41:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-01 23:41:52,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:52,316 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:52,316 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:52,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1664856822, now seen corresponding path program 20 times [2019-10-01 23:41:52,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:52,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:52,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 6 proven. 676 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-01 23:41:52,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:52,727 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 23:41:52,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:52,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:52,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:52,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:41:52,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-01 23:41:52,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:52,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:41:52,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:41:52,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:41:52,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:41:52,876 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 30 states. [2019-10-01 23:41:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:53,001 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2019-10-01 23:41:53,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:41:53,002 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2019-10-01 23:41:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:53,003 INFO L225 Difference]: With dead ends: 178 [2019-10-01 23:41:53,003 INFO L226 Difference]: Without dead ends: 120 [2019-10-01 23:41:53,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:41:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-01 23:41:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-10-01 23:41:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 23:41:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-10-01 23:41:53,012 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-10-01 23:41:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:53,012 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-10-01 23:41:53,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:41:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-10-01 23:41:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-01 23:41:53,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:53,014 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:53,015 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:53,016 INFO L82 PathProgramCache]: Analyzing trace with hash 431340728, now seen corresponding path program 21 times [2019-10-01 23:41:53,016 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:53,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:53,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 6 proven. 729 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-01 23:41:53,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:53,633 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 23:41:53,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:41:53,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:41:53,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:53,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-01 23:41:53,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:53,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:41:53,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:41:53,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:41:53,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:41:53,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:41:56,267 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|)) (.cse1 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|))) (and (= (select .cse0 12) (select .cse1 12)) (= (select .cse0 4) (select .cse1 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_8| |v_main_~#a~0.base_BEFORE_CALL_8|))))) is different from true [2019-10-01 23:41:58,448 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|)) (.cse1 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|))) (and (= (select .cse0 4) (select .cse1 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_9| |v_main_~#a~0.base_BEFORE_CALL_9|)) (= (select .cse0 12) (select .cse1 12))))) is different from true [2019-10-01 23:42:00,494 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-10-01 23:42:02,547 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-01 23:42:04,671 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|)) (.cse1 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|))) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_10|)) (= (select .cse0 4) (select .cse1 4)) (= (select .cse0 12) (select .cse1 12))))) is different from true [2019-10-01 23:42:04,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-10-01 23:42:04,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:42:04,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:42:04,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:42:04,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:3 [2019-10-01 23:42:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 754 trivial. 17 not checked. [2019-10-01 23:42:07,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:07,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 52 [2019-10-01 23:42:07,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 23:42:07,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 23:42:07,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=1867, Unknown=4, NotChecked=288, Total=2652 [2019-10-01 23:42:07,121 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 52 states. [2019-10-01 23:42:14,628 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-10-01 23:42:18,703 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-10-01 23:42:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:21,099 INFO L93 Difference]: Finished difference Result 190 states and 195 transitions. [2019-10-01 23:42:21,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:42:21,100 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 116 [2019-10-01 23:42:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:21,101 INFO L225 Difference]: With dead ends: 190 [2019-10-01 23:42:21,101 INFO L226 Difference]: Without dead ends: 132 [2019-10-01 23:42:21,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=1382, Invalid=5105, Unknown=5, NotChecked=480, Total=6972 [2019-10-01 23:42:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-01 23:42:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-10-01 23:42:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 23:42:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-10-01 23:42:21,111 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 116 [2019-10-01 23:42:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:21,111 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-10-01 23:42:21,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 23:42:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-10-01 23:42:21,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 23:42:21,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:21,113 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 9, 9, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:21,113 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:21,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1406139274, now seen corresponding path program 22 times [2019-10-01 23:42:21,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:21,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:21,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 8 proven. 784 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 23:42:21,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:21,654 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:42:21,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:21,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:21,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:21,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:42:21,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-01 23:42:21,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:21,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:42:21,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:42:21,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:42:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:42:21,830 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 32 states. [2019-10-01 23:42:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:21,965 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2019-10-01 23:42:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:42:21,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-10-01 23:42:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:21,967 INFO L225 Difference]: With dead ends: 198 [2019-10-01 23:42:21,967 INFO L226 Difference]: Without dead ends: 132 [2019-10-01 23:42:21,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:42:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-01 23:42:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-10-01 23:42:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 23:42:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2019-10-01 23:42:21,975 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 126 [2019-10-01 23:42:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:21,975 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2019-10-01 23:42:21,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:42:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2019-10-01 23:42:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-01 23:42:21,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:21,977 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 9, 9, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:21,977 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2110747212, now seen corresponding path program 23 times [2019-10-01 23:42:21,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:21,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 8 proven. 841 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 23:42:22,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:22,698 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 23:42:22,776 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:53,590 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 23:43:53,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:53,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:43:53,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2019-10-01 23:43:53,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:53,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 23:43:53,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:43:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:43:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:43:53,833 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 42 states. [2019-10-01 23:43:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:54,064 INFO L93 Difference]: Finished difference Result 203 states and 209 transitions. [2019-10-01 23:43:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 23:43:54,066 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2019-10-01 23:43:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:54,068 INFO L225 Difference]: With dead ends: 203 [2019-10-01 23:43:54,068 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 23:43:54,069 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:43:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 23:43:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 23:43:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 23:43:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2019-10-01 23:43:54,076 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 128 [2019-10-01 23:43:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:54,077 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2019-10-01 23:43:54,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:43:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2019-10-01 23:43:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 23:43:54,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:54,078 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:54,078 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1551280042, now seen corresponding path program 24 times [2019-10-01 23:43:54,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:54,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:54,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 8 proven. 900 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-01 23:43:54,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:54,716 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 23:43:54,766 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:44:21,400 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 23:44:21,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:21,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:44:21,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 59 proven. 100 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2019-10-01 23:44:21,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:21,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 15] total 46 [2019-10-01 23:44:21,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 23:44:21,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 23:44:21,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1398, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:44:21,708 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 46 states. [2019-10-01 23:44:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:21,950 INFO L93 Difference]: Finished difference Result 210 states and 217 transitions. [2019-10-01 23:44:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 23:44:21,952 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 132 [2019-10-01 23:44:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:21,953 INFO L225 Difference]: With dead ends: 210 [2019-10-01 23:44:21,953 INFO L226 Difference]: Without dead ends: 142 [2019-10-01 23:44:21,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=672, Invalid=1398, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:44:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-01 23:44:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-10-01 23:44:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-01 23:44:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2019-10-01 23:44:21,960 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 132 [2019-10-01 23:44:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:21,960 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2019-10-01 23:44:21,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 23:44:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2019-10-01 23:44:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-01 23:44:21,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:21,962 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 11, 11, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:21,963 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1797044426, now seen corresponding path program 25 times [2019-10-01 23:44:21,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:21,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:21,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 8 proven. 1024 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 23:44:22,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:22,487 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 23:44:22,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:22,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:44:22,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:44:22,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:22,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:44:22,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:44:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:44:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:44:22,660 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 36 states. [2019-10-01 23:44:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:22,789 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2019-10-01 23:44:22,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:44:22,790 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2019-10-01 23:44:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:22,791 INFO L225 Difference]: With dead ends: 214 [2019-10-01 23:44:22,791 INFO L226 Difference]: Without dead ends: 144 [2019-10-01 23:44:22,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:44:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-01 23:44:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-10-01 23:44:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 23:44:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-10-01 23:44:22,801 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 138 [2019-10-01 23:44:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:22,801 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-10-01 23:44:22,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:44:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-10-01 23:44:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 23:44:22,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:22,802 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 11, 11, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:22,803 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:22,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:22,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1293542260, now seen corresponding path program 26 times [2019-10-01 23:44:22,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:22,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:22,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 8 proven. 1089 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 23:44:23,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:23,336 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 23:44:23,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:44:23,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:44:23,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:23,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:44:23,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-01 23:44:23,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:23,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:44:23,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:44:23,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:44:23,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:44:23,531 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 37 states. [2019-10-01 23:44:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:23,696 INFO L93 Difference]: Finished difference Result 216 states and 220 transitions. [2019-10-01 23:44:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:44:23,699 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-10-01 23:44:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:23,700 INFO L225 Difference]: With dead ends: 216 [2019-10-01 23:44:23,700 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 23:44:23,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 140 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 23:44:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 23:44:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 23:44:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 23:44:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2019-10-01 23:44:23,708 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 140 [2019-10-01 23:44:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:23,709 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2019-10-01 23:44:23,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:44:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2019-10-01 23:44:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:44:23,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:23,710 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 11, 11, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:23,710 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash 770021326, now seen corresponding path program 27 times [2019-10-01 23:44:23,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:23,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:23,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 8 proven. 1156 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 23:44:24,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:24,300 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 23:44:24,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:44:24,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 23:44:24,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:24,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 23:44:24,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:24,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:44:24,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:44:24,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:44:24,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:44:24,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:44:26,910 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) 16)) (not (= |v_main_~#a~0.base_BEFORE_CALL_12| |v_main_~#b~0.base_BEFORE_CALL_12|)))) is different from true [2019-10-01 23:44:29,013 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_13| Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_13| |v_main_~#b~0.base_BEFORE_CALL_13|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_13|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))) is different from true [2019-10-01 23:44:31,123 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_14| Int) (|v_main_~#b~0.base_BEFORE_CALL_14| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_14|) 16) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_14|) 16)) (not (= |v_main_~#a~0.base_BEFORE_CALL_14| |v_main_~#b~0.base_BEFORE_CALL_14|)))) is different from true [2019-10-01 23:44:33,228 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_15| Int) (|v_main_~#b~0.base_BEFORE_CALL_15| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_15| |v_main_~#b~0.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_15|) 16) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_15|) 16)))) is different from true [2019-10-01 23:44:35,270 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-01 23:44:37,332 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-01 23:44:37,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:44:37,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:44:37,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:44:37,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:44:37,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:44:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 1192 trivial. 31 not checked. [2019-10-01 23:44:39,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:39,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 25] total 60 [2019-10-01 23:44:39,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 23:44:39,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 23:44:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=2368, Unknown=5, NotChecked=444, Total=3540 [2019-10-01 23:44:39,593 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 60 states. [2019-10-01 23:44:43,634 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:44:49,856 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-10-01 23:44:53,926 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-01 23:44:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:56,021 INFO L93 Difference]: Finished difference Result 228 states and 233 transitions. [2019-10-01 23:44:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 23:44:56,022 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 142 [2019-10-01 23:44:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:56,024 INFO L225 Difference]: With dead ends: 228 [2019-10-01 23:44:56,024 INFO L226 Difference]: Without dead ends: 158 [2019-10-01 23:44:56,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=2085, Invalid=7237, Unknown=6, NotChecked=772, Total=10100 [2019-10-01 23:44:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-01 23:44:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2019-10-01 23:44:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-01 23:44:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2019-10-01 23:44:56,037 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 142 [2019-10-01 23:44:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:56,037 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2019-10-01 23:44:56,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 23:44:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2019-10-01 23:44:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 23:44:56,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:56,039 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 11, 11, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:56,039 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 425456160, now seen corresponding path program 28 times [2019-10-01 23:44:56,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:56,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 10 proven. 1225 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 23:44:56,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:56,766 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 23:44:56,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:44:56,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:44:56,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:56,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:44:56,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:44:56,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:56,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:44:56,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:44:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:44:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:44:56,964 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 39 states. [2019-10-01 23:44:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:57,148 INFO L93 Difference]: Finished difference Result 236 states and 240 transitions. [2019-10-01 23:44:57,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:44:57,149 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 152 [2019-10-01 23:44:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:57,150 INFO L225 Difference]: With dead ends: 236 [2019-10-01 23:44:57,150 INFO L226 Difference]: Without dead ends: 158 [2019-10-01 23:44:57,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:44:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-01 23:44:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-10-01 23:44:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 23:44:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-10-01 23:44:57,160 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 152 [2019-10-01 23:44:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:57,160 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-10-01 23:44:57,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:44:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-10-01 23:44:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-01 23:44:57,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:57,161 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 11, 11, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:57,162 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2143459938, now seen corresponding path program 29 times [2019-10-01 23:44:57,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:57,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:57,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:57,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:57,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1517 backedges. 10 proven. 1296 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 23:44:57,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:57,836 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 23:44:57,893 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:48:24,339 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-10-01 23:48:24,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:24,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:48:24,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1517 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1396 trivial. 0 not checked. [2019-10-01 23:48:24,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:24,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 23:48:24,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 23:48:24,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 23:48:24,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:48:24,736 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 51 states. [2019-10-01 23:48:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:24,985 INFO L93 Difference]: Finished difference Result 241 states and 247 transitions. [2019-10-01 23:48:24,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 23:48:24,991 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2019-10-01 23:48:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:24,994 INFO L225 Difference]: With dead ends: 241 [2019-10-01 23:48:24,994 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 23:48:24,995 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:48:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 23:48:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-01 23:48:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 23:48:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-10-01 23:48:25,009 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 154 [2019-10-01 23:48:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:25,010 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-10-01 23:48:25,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 23:48:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-10-01 23:48:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-01 23:48:25,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:25,012 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 12, 12, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:25,012 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:25,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1977361472, now seen corresponding path program 30 times [2019-10-01 23:48:25,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:25,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:25,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 10 proven. 1369 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:48:25,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:25,932 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 23:48:25,994 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:48:33,604 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:48:33,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:33,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:48:33,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2019-10-01 23:48:34,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:34,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 15] total 53 [2019-10-01 23:48:34,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 23:48:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 23:48:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=884, Invalid=1872, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:48:34,013 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 53 states. [2019-10-01 23:48:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:34,291 INFO L93 Difference]: Finished difference Result 247 states and 253 transitions. [2019-10-01 23:48:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 23:48:34,291 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 158 [2019-10-01 23:48:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:34,292 INFO L225 Difference]: With dead ends: 247 [2019-10-01 23:48:34,292 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 23:48:34,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=884, Invalid=1872, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:48:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 23:48:34,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2019-10-01 23:48:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 23:48:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2019-10-01 23:48:34,302 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 158 [2019-10-01 23:48:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:34,302 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2019-10-01 23:48:34,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 23:48:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2019-10-01 23:48:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 23:48:34,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:34,303 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 13, 13, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:34,303 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:34,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1034472606, now seen corresponding path program 31 times [2019-10-01 23:48:34,304 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:34,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:34,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 10 proven. 1444 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-01 23:48:34,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:34,998 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 23:48:35,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:48:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:35,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:48:35,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-10-01 23:48:35,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:35,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:48:35,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:48:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:48:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:48:35,205 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 42 states. [2019-10-01 23:48:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:35,359 INFO L93 Difference]: Finished difference Result 250 states and 254 transitions. [2019-10-01 23:48:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:48:35,361 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2019-10-01 23:48:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:35,362 INFO L225 Difference]: With dead ends: 250 [2019-10-01 23:48:35,362 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 23:48:35,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:48:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 23:48:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-10-01 23:48:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 23:48:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2019-10-01 23:48:35,372 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 162 [2019-10-01 23:48:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:35,372 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2019-10-01 23:48:35,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:48:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2019-10-01 23:48:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-01 23:48:35,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:35,373 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 13, 13, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:35,374 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:35,374 INFO L82 PathProgramCache]: Analyzing trace with hash -724333984, now seen corresponding path program 32 times [2019-10-01 23:48:35,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:35,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:35,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:35,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:48:35,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 10 proven. 1521 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-01 23:48:36,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:36,223 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 23:48:36,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:48:36,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:48:36,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:36,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:48:36,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-10-01 23:48:36,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:36,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 23:48:36,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 23:48:36,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 23:48:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:48:36,441 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 43 states. [2019-10-01 23:48:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:36,618 INFO L93 Difference]: Finished difference Result 252 states and 256 transitions. [2019-10-01 23:48:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 23:48:36,619 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-10-01 23:48:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:36,620 INFO L225 Difference]: With dead ends: 252 [2019-10-01 23:48:36,620 INFO L226 Difference]: Without dead ends: 170 [2019-10-01 23:48:36,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:48:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-01 23:48:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-10-01 23:48:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 23:48:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2019-10-01 23:48:36,629 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 164 [2019-10-01 23:48:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:36,629 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2019-10-01 23:48:36,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 23:48:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2019-10-01 23:48:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-01 23:48:36,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:36,631 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 13, 13, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:36,631 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1279647650, now seen corresponding path program 33 times [2019-10-01 23:48:36,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:36,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:36,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:36,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:36,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 10 proven. 1600 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-01 23:48:37,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:37,383 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 23:48:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:48:37,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 23:48:37,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:37,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 23:48:37,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:37,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:48:37,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:48:37,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:48:37,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:48:37,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:48:40,142 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_17| |v_main_~#b~0.base_BEFORE_CALL_17|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_17|) 20) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) 20)))) is different from true [2019-10-01 23:48:42,246 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_18| Int) (|v_main_~#b~0.base_BEFORE_CALL_18| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_18|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_18|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_18| |v_main_~#b~0.base_BEFORE_CALL_18|)))) is different from true [2019-10-01 23:48:44,364 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| Int) (|v_main_~#b~0.base_BEFORE_CALL_19| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_19| |v_main_~#b~0.base_BEFORE_CALL_19|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_19|) 20)))) is different from true [2019-10-01 23:48:46,471 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_20| Int) (|v_main_~#a~0.base_BEFORE_CALL_20| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_20|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_20|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_20| |v_main_~#b~0.base_BEFORE_CALL_20|)))) is different from true [2019-10-01 23:48:48,624 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_21| Int) (|v_main_~#b~0.base_BEFORE_CALL_21| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_21|) 20) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_21|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_21| |v_main_~#b~0.base_BEFORE_CALL_21|)))) is different from true [2019-10-01 23:48:48,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:48:48,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:48:48,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:48:48,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:48:48,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:48:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 1649 trivial. 50 not checked. [2019-10-01 23:48:48,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:48,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 26] total 67 [2019-10-01 23:48:48,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:48:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:48:48,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=2833, Unknown=5, NotChecked=620, Total=4422 [2019-10-01 23:48:48,985 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 67 states. [2019-10-01 23:48:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:51,990 INFO L93 Difference]: Finished difference Result 264 states and 269 transitions. [2019-10-01 23:48:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:48:51,991 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 166 [2019-10-01 23:48:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:51,993 INFO L225 Difference]: With dead ends: 264 [2019-10-01 23:48:51,993 INFO L226 Difference]: Without dead ends: 182 [2019-10-01 23:48:51,994 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=2782, Invalid=8363, Unknown=5, NotChecked=1060, Total=12210 [2019-10-01 23:48:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-01 23:48:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2019-10-01 23:48:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-01 23:48:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2019-10-01 23:48:52,004 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 166 [2019-10-01 23:48:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:52,004 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2019-10-01 23:48:52,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:48:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2019-10-01 23:48:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 23:48:52,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:52,006 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 13, 13, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:52,006 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:52,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:52,006 INFO L82 PathProgramCache]: Analyzing trace with hash -245661708, now seen corresponding path program 34 times [2019-10-01 23:48:52,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:52,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:52,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 12 proven. 1681 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-01 23:48:52,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:52,801 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 23:48:52,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:48:52,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:48:52,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:52,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:48:52,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:48:53,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:53,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 23:48:53,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 23:48:53,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 23:48:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:48:53,029 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand 45 states. [2019-10-01 23:48:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:53,227 INFO L93 Difference]: Finished difference Result 272 states and 276 transitions. [2019-10-01 23:48:53,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 23:48:53,227 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 176 [2019-10-01 23:48:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:53,229 INFO L225 Difference]: With dead ends: 272 [2019-10-01 23:48:53,229 INFO L226 Difference]: Without dead ends: 182 [2019-10-01 23:48:53,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:48:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-01 23:48:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-10-01 23:48:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 23:48:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2019-10-01 23:48:53,239 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 176 [2019-10-01 23:48:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:53,240 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2019-10-01 23:48:53,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 23:48:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2019-10-01 23:48:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 23:48:53,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:53,241 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 13, 13, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:53,241 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash -859962826, now seen corresponding path program 35 times [2019-10-01 23:48:53,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:53,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:53,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 12 proven. 1764 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-01 23:48:54,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:54,054 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 23:48:54,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:53:03,735 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-10-01 23:53:03,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:53:03,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:53:03,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:53:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2019-10-01 23:53:04,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:53:04,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 16] total 59 [2019-10-01 23:53:04,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 23:53:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 23:53:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:53:04,270 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 59 states. [2019-10-01 23:53:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:53:04,524 INFO L93 Difference]: Finished difference Result 277 states and 283 transitions. [2019-10-01 23:53:04,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 23:53:04,524 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2019-10-01 23:53:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:53:04,525 INFO L225 Difference]: With dead ends: 277 [2019-10-01 23:53:04,525 INFO L226 Difference]: Without dead ends: 187 [2019-10-01 23:53:04,526 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:53:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-01 23:53:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-10-01 23:53:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 23:53:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-10-01 23:53:04,535 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 178 [2019-10-01 23:53:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:53:04,535 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-10-01 23:53:04,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 23:53:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-10-01 23:53:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-01 23:53:04,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:53:04,537 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 14, 14, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:53:04,537 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:53:04,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:53:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1257455468, now seen corresponding path program 36 times [2019-10-01 23:53:04,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:53:04,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:53:04,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:53:04,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:53:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:53:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:53:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 12 proven. 1849 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-01 23:53:05,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:53:05,535 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 23:53:05,610 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE