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-tiling/pnr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:25:46,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:25:46,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:25:46,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:25:46,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:25:46,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:25:46,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:25:46,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:25:46,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:25:46,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:25:46,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:25:46,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:25:46,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:25:46,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:25:46,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:25:46,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:25:46,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:25:46,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:25:46,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:25:46,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:25:46,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:25:46,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:25:46,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:25:46,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:25:46,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:25:46,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:25:46,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:25:46,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:25:46,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:25:46,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:25:46,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:25:46,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:25:46,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:25:46,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:25:46,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:25:46,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:25:46,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:25:46,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:25:46,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:25:46,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:25:46,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:25:46,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:25:46,410 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:25:46,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:25:46,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:25:46,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:25:46,412 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:25:46,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:25:46,414 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:25:46,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:25:46,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:25:46,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:25:46,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:25:46,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:25:46,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:25:46,417 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:25:46,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:25:46,417 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:25:46,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:25:46,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:25:46,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:25:46,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:25:46,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:25:46,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:25:46,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:25:46,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:25:46,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:25:46,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:25:46,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:25:46,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:25:46,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:25:46,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:25:46,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:25:46,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:25:46,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:25:46,475 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:25:46,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr3.c [2019-10-02 00:25:46,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f597810/4cffa5de7f784243914a7e9df19ab1d0/FLAG8a1ef95f5 [2019-10-02 00:25:47,039 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:25:47,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr3.c [2019-10-02 00:25:47,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f597810/4cffa5de7f784243914a7e9df19ab1d0/FLAG8a1ef95f5 [2019-10-02 00:25:47,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f597810/4cffa5de7f784243914a7e9df19ab1d0 [2019-10-02 00:25:47,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:25:47,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:25:47,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:25:47,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:25:47,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:25:47,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67abe819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47, skipping insertion in model container [2019-10-02 00:25:47,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:25:47,443 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:25:47,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:25:47,745 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:25:47,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:25:47,802 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:25:47,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47 WrapperNode [2019-10-02 00:25:47,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:25:47,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:25:47,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:25:47,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:25:47,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... [2019-10-02 00:25:47,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:25:47,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:25:47,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:25:47,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:25:47,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:25:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:25:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:25:48,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 00:25:48,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-10-02 00:25:48,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:25:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:25:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 00:25:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 00:25:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:25:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 00:25:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-10-02 00:25:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:25:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 00:25:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 00:25:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 00:25:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:25:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:25:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 00:25:48,356 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:25:48,357 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 00:25:48,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:25:48 BoogieIcfgContainer [2019-10-02 00:25:48,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:25:48,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:25:48,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:25:48,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:25:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:25:47" (1/3) ... [2019-10-02 00:25:48,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ec0795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:25:48, skipping insertion in model container [2019-10-02 00:25:48,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:47" (2/3) ... [2019-10-02 00:25:48,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ec0795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:25:48, skipping insertion in model container [2019-10-02 00:25:48,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:25:48" (3/3) ... [2019-10-02 00:25:48,366 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr3.c [2019-10-02 00:25:48,380 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:25:48,390 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:25:48,408 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:25:48,442 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:25:48,443 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:25:48,443 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:25:48,443 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:25:48,444 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:25:48,444 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:25:48,444 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:25:48,444 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:25:48,444 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:25:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-02 00:25:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 00:25:48,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:48,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:48,474 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash 342601179, now seen corresponding path program 1 times [2019-10-02 00:25:48,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:48,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:48,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:48,645 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-02 00:25:48,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:25:48,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 00:25:48,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 00:25:48,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 00:25:48,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:25:48,664 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-10-02 00:25:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:48,686 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-02 00:25:48,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 00:25:48,688 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-02 00:25:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:48,697 INFO L225 Difference]: With dead ends: 54 [2019-10-02 00:25:48,698 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 00:25:48,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:25:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 00:25:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-02 00:25:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 00:25:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-02 00:25:48,747 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 15 [2019-10-02 00:25:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:48,747 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-02 00:25:48,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 00:25:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-10-02 00:25:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 00:25:48,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:48,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:48,750 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:48,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash 374798206, now seen corresponding path program 1 times [2019-10-02 00:25:48,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:48,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:48,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:49,001 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-02 00:25:49,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:25:49,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:25:49,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:25:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:25:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:25:49,005 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2019-10-02 00:25:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:49,144 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-10-02 00:25:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:25:49,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-02 00:25:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:49,148 INFO L225 Difference]: With dead ends: 55 [2019-10-02 00:25:49,148 INFO L226 Difference]: Without dead ends: 44 [2019-10-02 00:25:49,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:25:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-02 00:25:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2019-10-02 00:25:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 00:25:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-02 00:25:49,161 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 15 [2019-10-02 00:25:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:49,161 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-02 00:25:49,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:25:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-02 00:25:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 00:25:49,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:49,163 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:49,163 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 919940654, now seen corresponding path program 1 times [2019-10-02 00:25:49,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:49,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:49,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:49,529 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-02 00:25:49,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:49,530 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:49,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:49,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 00:25:49,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:49,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:25:49,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:49,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:25:49,772 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:25:49,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-10-02 00:25:49,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:49,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-10-02 00:25:49,802 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-02 00:25:49,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-10-02 00:25:49,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:49,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-10-02 00:25:49,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 8 [2019-10-02 00:25:49,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:49,857 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-02 00:25:49,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-10-02 00:25:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:49,892 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-02 00:25:49,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:49,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-10-02 00:25:49,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 00:25:49,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 00:25:49,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:25:49,902 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 16 states. [2019-10-02 00:25:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:50,335 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2019-10-02 00:25:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 00:25:50,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-10-02 00:25:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:50,339 INFO L225 Difference]: With dead ends: 81 [2019-10-02 00:25:50,339 INFO L226 Difference]: Without dead ends: 79 [2019-10-02 00:25:50,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:25:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-02 00:25:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2019-10-02 00:25:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 00:25:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-10-02 00:25:50,370 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 35 [2019-10-02 00:25:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:50,371 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-10-02 00:25:50,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 00:25:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-10-02 00:25:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 00:25:50,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:50,375 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:50,375 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1342642480, now seen corresponding path program 1 times [2019-10-02 00:25:50,376 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:50,732 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-02 00:25:50,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:50,732 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:25:50,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:50,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 00:25:50,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:50,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:25:50,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:50,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:50,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:50,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:25:51,007 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:25:51,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:25:51,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:51,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:51,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:51,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:25:51,096 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-02 00:25:51,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-10-02 00:25:51,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:51,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:51,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:51,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-10-02 00:25:51,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-10-02 00:25:51,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:51,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:51,184 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-02 00:25:51,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-10-02 00:25:51,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:51,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:51,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-10-02 00:25:51,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 00:25:51,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 00:25:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-10-02 00:25:51,245 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 19 states. [2019-10-02 00:25:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:52,417 INFO L93 Difference]: Finished difference Result 163 states and 212 transitions. [2019-10-02 00:25:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:25:52,418 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-10-02 00:25:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:52,424 INFO L225 Difference]: With dead ends: 163 [2019-10-02 00:25:52,424 INFO L226 Difference]: Without dead ends: 161 [2019-10-02 00:25:52,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 00:25:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-02 00:25:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 40. [2019-10-02 00:25:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 00:25:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-10-02 00:25:52,441 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 35 [2019-10-02 00:25:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:52,441 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-10-02 00:25:52,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 00:25:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-10-02 00:25:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 00:25:52,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:52,443 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:52,443 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1026063511, now seen corresponding path program 1 times [2019-10-02 00:25:52,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:52,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:52,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 00:25:52,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:52,591 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:52,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:52,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 00:25:52,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:52,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:25:52,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:52,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:52,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:52,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:25:52,693 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:25:52,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-10-02 00:25:52,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:52,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:52,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:52,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-02 00:25:52,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 8 [2019-10-02 00:25:52,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:52,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:52,713 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-02 00:25:52,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-10-02 00:25:52,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 00:25:52,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:52,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-02 00:25:52,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 00:25:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 00:25:52,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 00:25:52,745 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 12 states. [2019-10-02 00:25:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:53,011 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-10-02 00:25:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 00:25:53,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2019-10-02 00:25:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:53,015 INFO L225 Difference]: With dead ends: 84 [2019-10-02 00:25:53,015 INFO L226 Difference]: Without dead ends: 82 [2019-10-02 00:25:53,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:25:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-02 00:25:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2019-10-02 00:25:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-02 00:25:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2019-10-02 00:25:53,029 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 43 [2019-10-02 00:25:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:53,030 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2019-10-02 00:25:53,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 00:25:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2019-10-02 00:25:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 00:25:53,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:53,032 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:53,032 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash -779374823, now seen corresponding path program 1 times [2019-10-02 00:25:53,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:53,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 00:25:53,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:53,219 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:53,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:53,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 00:25:53,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:53,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:25:53,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:53,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:53,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:53,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:25:53,402 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:25:53,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:25:53,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:53,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:53,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:53,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:25:53,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-10-02 00:25:53,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:53,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:53,543 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-02 00:25:53,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:25:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:53,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:53,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-02 00:25:53,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:25:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:25:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:25:53,623 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 20 states. [2019-10-02 00:26:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:02,977 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2019-10-02 00:26:02,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:26:02,978 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-10-02 00:26:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:02,981 INFO L225 Difference]: With dead ends: 172 [2019-10-02 00:26:02,981 INFO L226 Difference]: Without dead ends: 170 [2019-10-02 00:26:02,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 00:26:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-02 00:26:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 48. [2019-10-02 00:26:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 00:26:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-10-02 00:26:03,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 43 [2019-10-02 00:26:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:03,010 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-10-02 00:26:03,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:26:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-10-02 00:26:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 00:26:03,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:03,014 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:03,014 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -362851840, now seen corresponding path program 2 times [2019-10-02 00:26:03,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:03,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:26:03,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:03,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 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-02 00:26:03,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:26:03,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:26:03,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:26:03,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 00:26:03,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:03,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 00:26:03,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:03,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:03,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:03,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:26:03,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 8 [2019-10-02 00:26:03,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:03,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:03,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:03,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-10-02 00:26:03,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:26:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:03,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-10-02 00:26:03,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 00:26:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 00:26:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2019-10-02 00:26:03,517 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 21 states. [2019-10-02 00:26:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:22,277 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2019-10-02 00:26:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 00:26:22,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2019-10-02 00:26:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:22,280 INFO L225 Difference]: With dead ends: 147 [2019-10-02 00:26:22,280 INFO L226 Difference]: Without dead ends: 145 [2019-10-02 00:26:22,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:26:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-02 00:26:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2019-10-02 00:26:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 00:26:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2019-10-02 00:26:22,304 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 51 [2019-10-02 00:26:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:22,304 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2019-10-02 00:26:22,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 00:26:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2019-10-02 00:26:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 00:26:22,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:22,306 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:22,306 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash -222303230, now seen corresponding path program 1 times [2019-10-02 00:26:22,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:22,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:22,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:26:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:26:22,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:22,477 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:22,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:22,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 00:26:22,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:22,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 00:26:22,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:22,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:22,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:22,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:26:22,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-10-02 00:26:22,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:22,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:22,784 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-02 00:26:22,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:26:22,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:26:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:22,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-10-02 00:26:22,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:26:22,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:26:22,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:26:22,853 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand 22 states. [2019-10-02 00:26:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:42,381 INFO L93 Difference]: Finished difference Result 190 states and 237 transitions. [2019-10-02 00:26:42,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 00:26:42,382 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-10-02 00:26:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:42,385 INFO L225 Difference]: With dead ends: 190 [2019-10-02 00:26:42,386 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 00:26:42,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 00:26:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 00:26:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-10-02 00:26:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-02 00:26:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 172 transitions. [2019-10-02 00:26:42,443 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 172 transitions. Word has length 51 [2019-10-02 00:26:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:42,444 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 172 transitions. [2019-10-02 00:26:42,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:26:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2019-10-02 00:26:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 00:26:42,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:42,448 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:42,449 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1040011671, now seen corresponding path program 3 times [2019-10-02 00:26:42,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:42,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 00:26:42,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:42,803 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-02 00:26:42,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:26:42,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 00:26:42,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:26:42,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 00:26:42,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:26:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:26:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 00:26:43,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:43,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-02 00:26:43,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 00:26:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 00:26:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:26:43,091 INFO L87 Difference]: Start difference. First operand 133 states and 172 transitions. Second operand 18 states. [2019-10-02 00:26:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:43,524 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2019-10-02 00:26:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:26:43,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-10-02 00:26:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:43,530 INFO L225 Difference]: With dead ends: 186 [2019-10-02 00:26:43,530 INFO L226 Difference]: Without dead ends: 135 [2019-10-02 00:26:43,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:26:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-02 00:26:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-10-02 00:26:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-02 00:26:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2019-10-02 00:26:43,560 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 170 transitions. Word has length 59 [2019-10-02 00:26:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:43,560 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 170 transitions. [2019-10-02 00:26:43,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 00:26:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2019-10-02 00:26:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 00:26:43,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:43,563 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:43,563 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash -720528103, now seen corresponding path program 4 times [2019-10-02 00:26:43,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:43,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:26:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 00:26:43,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:43,725 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:43,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:26:43,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:26:43,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:26:43,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 00:26:43,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:43,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:26:43,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:43,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:43,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:43,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-10-02 00:26:43,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:26:43,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-10-02 00:26:43,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:43,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:43,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:43,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-10-02 00:26:44,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:26:44,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-10-02 00:26:44,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:44,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:44,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:44,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-10-02 00:26:44,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 8 [2019-10-02 00:26:44,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:44,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:44,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:44,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-10-02 00:26:44,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 00:26:44,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:44,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-10-02 00:26:44,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 00:26:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 00:26:44,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:26:44,376 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. Second operand 25 states. [2019-10-02 00:27:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:27:56,272 INFO L93 Difference]: Finished difference Result 474 states and 657 transitions. [2019-10-02 00:27:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 00:27:56,273 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2019-10-02 00:27:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:27:56,277 INFO L225 Difference]: With dead ends: 474 [2019-10-02 00:27:56,277 INFO L226 Difference]: Without dead ends: 472 [2019-10-02 00:27:56,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=1476, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 00:27:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-02 00:27:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 224. [2019-10-02 00:27:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-02 00:27:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2019-10-02 00:27:56,335 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 79 [2019-10-02 00:27:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:27:56,335 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2019-10-02 00:27:56,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 00:27:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2019-10-02 00:27:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 00:27:56,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:27:56,337 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:27:56,338 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:27:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:27:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash 172958235, now seen corresponding path program 1 times [2019-10-02 00:27:56,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:27:56,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:27:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:56,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:27:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:27:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 00:27:56,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:27:56,549 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 00:27:56,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:27:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:27:56,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 00:27:56,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:27:56,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:27:56,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:56,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:56,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:27:56,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:27:56,776 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-10-02 00:27:56,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:27:56,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:56,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:56,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:27:56,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-02 00:27:56,842 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:27:56,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:27:56,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:56,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:56,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:27:56,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:27:57,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-10-02 00:27:57,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:57,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:57,088 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-02 00:27:57,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:27:57,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:27:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 00:27:57,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:27:57,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-10-02 00:27:57,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 00:27:57,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 00:27:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-10-02 00:27:57,171 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand 26 states. [2019-10-02 00:28:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:28:28,666 INFO L93 Difference]: Finished difference Result 684 states and 930 transitions. [2019-10-02 00:28:28,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 00:28:28,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2019-10-02 00:28:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:28:28,673 INFO L225 Difference]: With dead ends: 684 [2019-10-02 00:28:28,673 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 00:28:28,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=565, Invalid=3341, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 00:28:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 00:28:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 353. [2019-10-02 00:28:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-02 00:28:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 480 transitions. [2019-10-02 00:28:28,726 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 480 transitions. Word has length 79 [2019-10-02 00:28:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:28:28,727 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 480 transitions. [2019-10-02 00:28:28,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 00:28:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 480 transitions. [2019-10-02 00:28:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 00:28:28,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:28:28,729 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:28:28,729 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:28:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:28:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1511731070, now seen corresponding path program 5 times [2019-10-02 00:28:28,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:28:28,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:28:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:28,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:28:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 00:28:28,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:28:28,908 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:28:28,941 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:28:29,008 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 00:28:29,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:28:29,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 00:28:29,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:28:29,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:28:29,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:29,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:28:29,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:28:29,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-10-02 00:28:29,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:29,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-10-02 00:28:29,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 8 [2019-10-02 00:28:29,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:29,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:29,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-02 00:28:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:28:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 00:28:29,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:28:29,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-10-02 00:28:29,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 00:28:29,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 00:28:29,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:28:29,337 INFO L87 Difference]: Start difference. First operand 353 states and 480 transitions. Second operand 25 states. [2019-10-02 00:28:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:28:31,935 INFO L93 Difference]: Finished difference Result 1580 states and 2392 transitions. [2019-10-02 00:28:31,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 00:28:31,935 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-10-02 00:28:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:28:31,947 INFO L225 Difference]: With dead ends: 1580 [2019-10-02 00:28:31,947 INFO L226 Difference]: Without dead ends: 1578 [2019-10-02 00:28:31,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=565, Invalid=3467, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 00:28:31,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2019-10-02 00:28:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 705. [2019-10-02 00:28:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-10-02 00:28:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1023 transitions. [2019-10-02 00:28:32,111 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1023 transitions. Word has length 87 [2019-10-02 00:28:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:28:32,111 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 1023 transitions. [2019-10-02 00:28:32,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 00:28:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1023 transitions. [2019-10-02 00:28:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 00:28:32,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:28:32,115 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:28:32,115 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:28:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:28:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1864819452, now seen corresponding path program 1 times [2019-10-02 00:28:32,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:28:32,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:28:32,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:32,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:28:32,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 00:28:32,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:28:32,493 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:28:32,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:28:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:32,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 00:28:32,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:28:32,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:28:32,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:32,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:28:32,749 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:28:32,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:28:32,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:32,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:32,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:28:33,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-10-02 00:28:33,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:33,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:33,063 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-02 00:28:33,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:28:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:28:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 00:28:33,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:28:33,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-10-02 00:28:33,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 00:28:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 00:28:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:28:33,136 INFO L87 Difference]: Start difference. First operand 705 states and 1023 transitions. Second operand 28 states. [2019-10-02 00:29:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:03,888 INFO L93 Difference]: Finished difference Result 1711 states and 2507 transitions. [2019-10-02 00:29:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 00:29:03,888 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2019-10-02 00:29:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:03,897 INFO L225 Difference]: With dead ends: 1711 [2019-10-02 00:29:03,897 INFO L226 Difference]: Without dead ends: 1709 [2019-10-02 00:29:03,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=636, Invalid=3920, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 00:29:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2019-10-02 00:29:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 669. [2019-10-02 00:29:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-02 00:29:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 957 transitions. [2019-10-02 00:29:03,999 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 957 transitions. Word has length 87 [2019-10-02 00:29:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:04,000 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 957 transitions. [2019-10-02 00:29:04,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 00:29:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 957 transitions. [2019-10-02 00:29:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 00:29:04,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:04,004 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:04,004 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 569019115, now seen corresponding path program 6 times [2019-10-02 00:29:04,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:04,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:04,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:04,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:04,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 10 proven. 63 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 00:29:04,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:04,184 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:29:04,298 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 00:29:04,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:04,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 00:29:04,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:04,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:29:04,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:04,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:04,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:29:04,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-10-02 00:29:04,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:04,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-10-02 00:29:04,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:04,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:29:04,498 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-10-02 00:29:04,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:04,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-10-02 00:29:04,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 10 proven. 63 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 00:29:04,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2019-10-02 00:29:04,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 00:29:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 00:29:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-10-02 00:29:04,565 INFO L87 Difference]: Start difference. First operand 669 states and 957 transitions. Second operand 21 states. [2019-10-02 00:29:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:09,572 INFO L93 Difference]: Finished difference Result 3387 states and 5248 transitions. [2019-10-02 00:29:09,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-02 00:29:09,573 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2019-10-02 00:29:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:09,592 INFO L225 Difference]: With dead ends: 3387 [2019-10-02 00:29:09,593 INFO L226 Difference]: Without dead ends: 3385 [2019-10-02 00:29:09,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=617, Invalid=5389, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 00:29:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2019-10-02 00:29:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 1461. [2019-10-02 00:29:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-10-02 00:29:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2191 transitions. [2019-10-02 00:29:09,880 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2191 transitions. Word has length 95 [2019-10-02 00:29:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:09,881 INFO L475 AbstractCegarLoop]: Abstraction has 1461 states and 2191 transitions. [2019-10-02 00:29:09,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 00:29:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2191 transitions. [2019-10-02 00:29:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 00:29:09,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:09,888 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:09,888 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 553500397, now seen corresponding path program 1 times [2019-10-02 00:29:09,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:09,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:09,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:29:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 10 proven. 63 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 00:29:10,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:10,157 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-02 00:29:10,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:10,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 00:29:10,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:10,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 00:29:10,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:10,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:10,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:10,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:29:10,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-10-02 00:29:10,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:10,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:10,733 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-02 00:29:10,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:29:10,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:29:10,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:10,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-10-02 00:29:10,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:29:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:29:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:29:10,816 INFO L87 Difference]: Start difference. First operand 1461 states and 2191 transitions. Second operand 30 states. [2019-10-02 00:29:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:43,596 INFO L93 Difference]: Finished difference Result 2890 states and 4318 transitions. [2019-10-02 00:29:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 00:29:43,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 95 [2019-10-02 00:29:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:43,609 INFO L225 Difference]: With dead ends: 2890 [2019-10-02 00:29:43,609 INFO L226 Difference]: Without dead ends: 2888 [2019-10-02 00:29:43,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 74 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=787, Invalid=5219, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 00:29:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-10-02 00:29:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1425. [2019-10-02 00:29:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-10-02 00:29:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2139 transitions. [2019-10-02 00:29:43,888 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2139 transitions. Word has length 95 [2019-10-02 00:29:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:43,888 INFO L475 AbstractCegarLoop]: Abstraction has 1425 states and 2139 transitions. [2019-10-02 00:29:43,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:29:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2139 transitions. [2019-10-02 00:29:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 00:29:43,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:43,894 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:43,895 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1369951316, now seen corresponding path program 7 times [2019-10-02 00:29:43,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:43,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 63 proven. 34 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 00:29:44,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:44,395 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:44,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:44,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 00:29:44,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:44,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:44,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:29:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:29:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 84 proven. 13 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 00:29:44,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:44,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-10-02 00:29:44,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 00:29:44,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 00:29:44,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2019-10-02 00:29:44,871 INFO L87 Difference]: Start difference. First operand 1425 states and 2139 transitions. Second operand 26 states. [2019-10-02 00:29:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:45,644 INFO L93 Difference]: Finished difference Result 1560 states and 2292 transitions. [2019-10-02 00:29:45,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 00:29:45,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2019-10-02 00:29:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:45,650 INFO L225 Difference]: With dead ends: 1560 [2019-10-02 00:29:45,650 INFO L226 Difference]: Without dead ends: 1455 [2019-10-02 00:29:45,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:29:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-10-02 00:29:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1425. [2019-10-02 00:29:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-10-02 00:29:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2123 transitions. [2019-10-02 00:29:45,938 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2123 transitions. Word has length 103 [2019-10-02 00:29:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:45,938 INFO L475 AbstractCegarLoop]: Abstraction has 1425 states and 2123 transitions. [2019-10-02 00:29:45,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 00:29:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2123 transitions. [2019-10-02 00:29:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 00:29:45,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:45,947 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:45,947 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1091269380, now seen corresponding path program 8 times [2019-10-02 00:29:45,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:45,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:45,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:45,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:45,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 12 proven. 108 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 00:29:46,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:46,234 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 00:29:46,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:29:46,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:29:46,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:46,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 00:29:46,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:46,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:29:46,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:46,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:46,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:46,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-10-02 00:29:46,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:29:46,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-10-02 00:29:46,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:46,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:46,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:46,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-10-02 00:29:46,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:29:46,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-10-02 00:29:46,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:46,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:46,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:46,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-10-02 00:29:47,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 8 [2019-10-02 00:29:47,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:47,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:47,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:47,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-10-02 00:29:47,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 42 proven. 120 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 00:29:47,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:47,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-10-02 00:29:47,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 00:29:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 00:29:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 00:29:47,347 INFO L87 Difference]: Start difference. First operand 1425 states and 2123 transitions. Second operand 33 states. [2019-10-02 00:34:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:34:34,529 INFO L93 Difference]: Finished difference Result 9294 states and 14570 transitions. [2019-10-02 00:34:34,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-10-02 00:34:34,530 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 123 [2019-10-02 00:34:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:34:34,607 INFO L225 Difference]: With dead ends: 9294 [2019-10-02 00:34:34,607 INFO L226 Difference]: Without dead ends: 9292 [2019-10-02 00:34:34,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 95 SyntacticMatches, 18 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18056 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3849, Invalid=39623, Unknown=0, NotChecked=0, Total=43472 [2019-10-02 00:34:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9292 states. [2019-10-02 00:34:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9292 to 2969. [2019-10-02 00:34:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2969 states. [2019-10-02 00:34:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 4501 transitions. [2019-10-02 00:34:35,303 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 4501 transitions. Word has length 123 [2019-10-02 00:34:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:34:35,305 INFO L475 AbstractCegarLoop]: Abstraction has 2969 states and 4501 transitions. [2019-10-02 00:34:35,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 00:34:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 4501 transitions. [2019-10-02 00:34:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 00:34:35,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:34:35,317 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:34:35,317 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:34:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:34:35,318 INFO L82 PathProgramCache]: Analyzing trace with hash 598643206, now seen corresponding path program 2 times [2019-10-02 00:34:35,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:34:35,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:34:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:34:35,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:34:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:34:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:34:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 12 proven. 108 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 00:34:35,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:34:35,690 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:34:35,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:34:35,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:34:35,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:34:35,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 00:34:35,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:34:35,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:34:35,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:34:35,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:34:35,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:34:35,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:34:36,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:34:36,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-02 00:34:36,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:34:36,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:34:36,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:34:36,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-02 00:34:36,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:34:36,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:34:36,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:34:36,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:34:36,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:34:36,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-10-02 00:34:36,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-10-02 00:34:36,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:34:36,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:34:36,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:34:36,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-02 00:34:36,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:34:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 42 proven. 120 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 00:34:36,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:34:36,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-10-02 00:34:36,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 00:34:36,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 00:34:36,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:34:36,891 INFO L87 Difference]: Start difference. First operand 2969 states and 4501 transitions. Second operand 34 states. [2019-10-02 00:34:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:34:50,946 INFO L93 Difference]: Finished difference Result 6533 states and 10020 transitions. [2019-10-02 00:34:50,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-02 00:34:50,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 123 [2019-10-02 00:34:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:34:50,967 INFO L225 Difference]: With dead ends: 6533 [2019-10-02 00:34:50,967 INFO L226 Difference]: Without dead ends: 6531 [2019-10-02 00:34:50,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 95 SyntacticMatches, 18 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1085, Invalid=7845, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 00:34:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2019-10-02 00:34:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 4020. [2019-10-02 00:34:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2019-10-02 00:34:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 6049 transitions. [2019-10-02 00:34:51,744 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 6049 transitions. Word has length 123 [2019-10-02 00:34:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:34:51,744 INFO L475 AbstractCegarLoop]: Abstraction has 4020 states and 6049 transitions. [2019-10-02 00:34:51,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 00:34:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 6049 transitions. [2019-10-02 00:34:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 00:34:51,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:34:51,759 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:34:51,760 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:34:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:34:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -804287635, now seen corresponding path program 9 times [2019-10-02 00:34:51,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:34:51,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:34:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:34:51,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:34:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:34:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:34:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 14 proven. 134 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 00:34:52,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:34:52,063 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:34:52,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:34:52,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 00:34:52,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:34:52,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 00:34:52,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:34:52,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:34:52,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:34:52,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:34:52,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:34:52,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:34:52,976 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:34:52,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-10-02 00:34:52,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:34:52,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:34:52,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:34:52,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-10-02 00:34:58,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 8 [2019-10-02 00:34:58,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:34:58,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:34:58,387 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-02 00:34:58,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-10-02 00:34:58,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:34:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 00:34:58,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:34:58,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-10-02 00:34:58,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 00:34:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 00:34:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 00:34:58,498 INFO L87 Difference]: Start difference. First operand 4020 states and 6049 transitions. Second operand 35 states. [2019-10-02 00:35:43,489 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-02 00:36:03,690 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-10-02 00:38:08,114 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 00:38:18,215 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-10-02 00:39:02,303 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 00:39:04,340 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 00:39:16,474 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 36