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/pnr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:30:34,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:30:34,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:30:34,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:30:34,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:30:34,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:30:34,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:30:34,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:30:34,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:30:34,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:30:34,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:30:34,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:30:34,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:30:34,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:30:34,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:30:34,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:30:34,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:30:34,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:30:34,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:30:34,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:30:34,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:30:34,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:30:34,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:30:34,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:30:34,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:30:34,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:30:34,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:30:34,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:30:34,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:30:34,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:30:34,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:30:34,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:30:34,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:30:34,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:30:34,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:30:34,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:30:34,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:30:34,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:30:34,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:30:34,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:30:34,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:30:34,427 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-09-07 11:30:34,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:30:34,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:30:34,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:30:34,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:30:34,452 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:30:34,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:30:34,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:30:34,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:30:34,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:30:34,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:30:34,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:30:34,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:30:34,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:30:34,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:30:34,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:30:34,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:30:34,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:30:34,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:30:34,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:30:34,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:30:34,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:30:34,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:30:34,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:30:34,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:30:34,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:30:34,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:30:34,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:30:34,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:30:34,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:30:34,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:30:34,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:30:34,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:30:34,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:30:34,545 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:30:34,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr2.c [2019-09-07 11:30:34,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19062754/24631feaa19249bcab8a27b4dcc3ad16/FLAG350b8db4f [2019-09-07 11:30:35,046 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:30:35,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr2.c [2019-09-07 11:30:35,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19062754/24631feaa19249bcab8a27b4dcc3ad16/FLAG350b8db4f [2019-09-07 11:30:35,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19062754/24631feaa19249bcab8a27b4dcc3ad16 [2019-09-07 11:30:35,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:30:35,479 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:30:35,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:30:35,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:30:35,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:30:35,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f22801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35, skipping insertion in model container [2019-09-07 11:30:35,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,496 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:30:35,511 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:30:35,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:30:35,724 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:30:35,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:30:35,844 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:30:35,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35 WrapperNode [2019-09-07 11:30:35,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:30:35,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:30:35,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:30:35,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:30:35,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (1/1) ... [2019-09-07 11:30:35,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:30:35,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:30:35,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:30:35,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:30:35,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (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-09-07 11:30:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:30:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:30:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 11:30:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-09-07 11:30:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:30:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:30:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 11:30:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 11:30:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:30:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 11:30:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-09-07 11:30:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:30:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 11:30:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:30:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:30:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:30:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:30:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:30:36,271 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:30:36,272 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 11:30:36,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:30:36 BoogieIcfgContainer [2019-09-07 11:30:36,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:30:36,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:30:36,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:30:36,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:30:36,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:30:35" (1/3) ... [2019-09-07 11:30:36,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e027d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:30:36, skipping insertion in model container [2019-09-07 11:30:36,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:30:35" (2/3) ... [2019-09-07 11:30:36,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e027d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:30:36, skipping insertion in model container [2019-09-07 11:30:36,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:30:36" (3/3) ... [2019-09-07 11:30:36,287 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr2.c [2019-09-07 11:30:36,297 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:30:36,306 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:30:36,323 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:30:36,350 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:30:36,351 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:30:36,351 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:30:36,351 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:30:36,351 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:30:36,351 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:30:36,352 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:30:36,352 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:30:36,352 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:30:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-07 11:30:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 11:30:36,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:36,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:36,376 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:36,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1000705867, now seen corresponding path program 1 times [2019-09-07 11:30:36,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:36,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:36,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:36,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:36,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:30:36,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:30:36,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:30:36,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:30:36,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:30:36,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:30:36,571 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-07 11:30:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:30:36,597 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-09-07 11:30:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:30:36,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 11:30:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:30:36,608 INFO L225 Difference]: With dead ends: 51 [2019-09-07 11:30:36,609 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 11:30:36,612 INFO L628 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-09-07 11:30:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 11:30:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-07 11:30:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 11:30:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-07 11:30:36,661 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2019-09-07 11:30:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:30:36,661 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-07 11:30:36,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:30:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-07 11:30:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 11:30:36,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:36,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:36,665 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:36,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash -457002250, now seen corresponding path program 1 times [2019-09-07 11:30:36,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:30:36,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:30:36,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:30:36,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:30:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:30:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:30:36,802 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-09-07 11:30:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:30:36,910 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-09-07 11:30:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:30:36,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-07 11:30:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:30:36,912 INFO L225 Difference]: With dead ends: 49 [2019-09-07 11:30:36,912 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 11:30:36,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:30:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 11:30:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-07 11:30:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 11:30:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-07 11:30:36,934 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-09-07 11:30:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:30:36,935 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-07 11:30:36,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:30:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-07 11:30:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 11:30:36,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:36,938 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:36,939 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1020388245, now seen corresponding path program 1 times [2019-09-07 11:30:36,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:36,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:36,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:30:37,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:30:37,306 INFO L223 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-09-07 11:30:37,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:37,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:30:37,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:30:37,517 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-09-07 11:30:37,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:37,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:37,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:37,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-07 11:30:37,583 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-09-07 11:30:37,584 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-09-07 11:30:37,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:37,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:37,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:37,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-09-07 11:30:37,640 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-09-07 11:30:37,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:37,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:37,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:37,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-09-07 11:30:37,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:30:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:30:37,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:30:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-09-07 11:30:37,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:30:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:30:37,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:30:37,685 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 16 states. [2019-09-07 11:30:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:30:37,995 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2019-09-07 11:30:37,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:30:37,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-09-07 11:30:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:30:37,998 INFO L225 Difference]: With dead ends: 69 [2019-09-07 11:30:37,998 INFO L226 Difference]: Without dead ends: 67 [2019-09-07 11:30:37,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:30:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-07 11:30:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2019-09-07 11:30:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 11:30:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-09-07 11:30:38,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2019-09-07 11:30:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:30:38,012 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-09-07 11:30:38,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:30:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-09-07 11:30:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 11:30:38,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:38,014 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:38,015 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1994715373, now seen corresponding path program 1 times [2019-09-07 11:30:38,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:38,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:38,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:30:38,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:30:38,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:30:38,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:38,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:30:38,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:30:38,415 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-09-07 11:30:38,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:38,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:38,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:38,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:30:38,516 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-09-07 11:30:38,517 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-09-07 11:30:38,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:38,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:38,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:38,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-09-07 11:30:38,584 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-09-07 11:30:38,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:38,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:38,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:38,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-09-07 11:30:38,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:30:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:30:38,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:30:38,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 11:30:38,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:30:38,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:30:38,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:30:38,665 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 19 states. [2019-09-07 11:30:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:30:39,794 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-09-07 11:30:39,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 11:30:39,794 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-09-07 11:30:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:30:39,799 INFO L225 Difference]: With dead ends: 139 [2019-09-07 11:30:39,799 INFO L226 Difference]: Without dead ends: 137 [2019-09-07 11:30:39,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:30:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-07 11:30:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 37. [2019-09-07 11:30:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 11:30:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-07 11:30:39,813 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 29 [2019-09-07 11:30:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:30:39,814 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-07 11:30:39,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:30:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-07 11:30:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 11:30:39,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:39,816 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:39,816 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash 552081240, now seen corresponding path program 1 times [2019-09-07 11:30:39,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:39,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:30:39,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:30:39,962 INFO L223 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-09-07 11:30:39,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:40,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:30:40,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:30:40,020 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-09-07 11:30:40,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:40,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-09-07 11:30:40,037 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-09-07 11:30:40,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:40,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 11:30:40,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:30:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:30:40,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:30:40,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-09-07 11:30:40,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 11:30:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 11:30:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:30:40,067 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2019-09-07 11:30:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:30:40,274 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2019-09-07 11:30:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:30:40,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-09-07 11:30:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:30:40,278 INFO L225 Difference]: With dead ends: 72 [2019-09-07 11:30:40,278 INFO L226 Difference]: Without dead ends: 70 [2019-09-07 11:30:40,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:30:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-07 11:30:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2019-09-07 11:30:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 11:30:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-09-07 11:30:40,291 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 37 [2019-09-07 11:30:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:30:40,291 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-09-07 11:30:40,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 11:30:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-09-07 11:30:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 11:30:40,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:40,293 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:40,293 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1036266662, now seen corresponding path program 1 times [2019-09-07 11:30:40,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:40,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:40,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:30:40,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:30:40,438 INFO L223 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) [2019-09-07 11:30:40,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:30:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:40,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:30:40,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:30:40,552 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-09-07 11:30:40,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:40,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:30:40,660 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-09-07 11:30:40,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:40,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:40,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:30:40,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:30:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:30:40,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:30:40,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-07 11:30:40,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:30:40,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:30:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:30:40,721 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 20 states. [2019-09-07 11:30:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:30:47,650 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2019-09-07 11:30:47,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:30:47,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-09-07 11:30:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:30:47,653 INFO L225 Difference]: With dead ends: 114 [2019-09-07 11:30:47,653 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 11:30:47,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:30:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 11:30:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 45. [2019-09-07 11:30:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 11:30:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-07 11:30:47,672 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 37 [2019-09-07 11:30:47,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:30:47,673 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-07 11:30:47,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:30:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-07 11:30:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 11:30:47,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:47,674 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:47,675 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash -849160891, now seen corresponding path program 2 times [2019-09-07 11:30:47,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:47,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:47,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:47,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:30:47,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 11:30:48,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:30:48,018 INFO L223 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-09-07 11:30:48,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:30:48,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:30:48,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:30:48,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:30:48,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:30:48,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:30:48,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:30:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:30:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 11:30:48,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:30:48,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-09-07 11:30:48,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:30:48,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:30:48,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:30:48,323 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 16 states. [2019-09-07 11:30:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:30:48,654 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-09-07 11:30:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:30:48,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-09-07 11:30:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:30:48,656 INFO L225 Difference]: With dead ends: 90 [2019-09-07 11:30:48,656 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 11:30:48,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:30:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 11:30:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-09-07 11:30:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:30:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-09-07 11:30:48,667 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 45 [2019-09-07 11:30:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:30:48,667 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-09-07 11:30:48,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:30:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-09-07 11:30:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 11:30:48,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:30:48,669 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:30:48,669 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:30:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:30:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -418118662, now seen corresponding path program 3 times [2019-09-07 11:30:48,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:30:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:30:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:48,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:30:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:30:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:30:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 11:30:48,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:30:48,800 INFO L223 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-09-07 11:30:48,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:30:48,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:30:48,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:30:48,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:30:48,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:30:48,925 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-09-07 11:30:48,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:48,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:48,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:48,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-09-07 11:30:49,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:30:49,005 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-09-07 11:30:49,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:49,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:49,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:49,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-09-07 11:30:49,186 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-09-07 11:30:49,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:30:49,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:30:49,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:30:49,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-09-07 11:30:49,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:30:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 11:30:49,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:30:49,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 11:30:49,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:30:49,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:30:49,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:30:49,250 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 23 states. [2019-09-07 11:31:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:31:15,602 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2019-09-07 11:31:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:31:15,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2019-09-07 11:31:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:31:15,605 INFO L225 Difference]: With dead ends: 133 [2019-09-07 11:31:15,605 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 11:31:15,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:31:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 11:31:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 74. [2019-09-07 11:31:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 11:31:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-09-07 11:31:15,620 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 59 [2019-09-07 11:31:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:31:15,620 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-09-07 11:31:15,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:31:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-09-07 11:31:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 11:31:15,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:31:15,622 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2019-09-07 11:31:15,622 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:31:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:31:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 283481212, now seen corresponding path program 1 times [2019-09-07 11:31:15,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:31:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:31:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:15,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:31:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:31:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 11:31:15,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:31:15,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:31:15,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:31:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:31:15,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:31:15,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:31:15,989 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-09-07 11:31:15,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:15,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:15,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:15,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:31:16,066 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:31:16,067 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-09-07 11:31:16,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:16,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:16,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:16,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-07 11:31:16,249 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-09-07 11:31:16,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:16,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:16,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:16,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:31:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:31:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:31:16,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:31:16,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-09-07 11:31:16,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 11:31:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 11:31:16,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:31:16,316 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 24 states. [2019-09-07 11:31:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:31:32,020 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2019-09-07 11:31:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:31:32,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2019-09-07 11:31:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:31:32,025 INFO L225 Difference]: With dead ends: 174 [2019-09-07 11:31:32,025 INFO L226 Difference]: Without dead ends: 172 [2019-09-07 11:31:32,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 11:31:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-07 11:31:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2019-09-07 11:31:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 11:31:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2019-09-07 11:31:32,065 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 59 [2019-09-07 11:31:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:31:32,065 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2019-09-07 11:31:32,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 11:31:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2019-09-07 11:31:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 11:31:32,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:31:32,075 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:31:32,075 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:31:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:31:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 573636583, now seen corresponding path program 4 times [2019-09-07 11:31:32,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:31:32,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:31:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:32,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:31:32,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:31:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:31:32,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:31:32,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:31:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:31:32,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:31:32,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:31:32,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:31:32,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:31:32,403 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-09-07 11:31:32,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:32,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:32,414 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-09-07 11:31:32,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-09-07 11:31:32,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:32,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-09-07 11:31:32,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:31:32,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:31:32,499 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-09-07 11:31:32,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:32,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-09-07 11:31:32,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:31:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:31:32,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:31:32,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2019-09-07 11:31:32,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 11:31:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 11:31:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:31:32,551 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand 17 states. [2019-09-07 11:31:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:31:33,335 INFO L93 Difference]: Finished difference Result 256 states and 343 transitions. [2019-09-07 11:31:33,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:31:33,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-07 11:31:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:31:33,344 INFO L225 Difference]: With dead ends: 256 [2019-09-07 11:31:33,344 INFO L226 Difference]: Without dead ends: 254 [2019-09-07 11:31:33,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:31:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-07 11:31:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 182. [2019-09-07 11:31:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 11:31:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2019-09-07 11:31:33,374 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 67 [2019-09-07 11:31:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:31:33,374 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2019-09-07 11:31:33,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 11:31:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2019-09-07 11:31:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 11:31:33,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:31:33,377 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:31:33,377 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:31:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:31:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 501250025, now seen corresponding path program 1 times [2019-09-07 11:31:33,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:31:33,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:31:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:33,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:31:33,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:31:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:31:33,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:31:33,583 INFO L223 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-09-07 11:31:33,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:31:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:31:33,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:31:33,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:31:33,744 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-09-07 11:31:33,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:33,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:33,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:33,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:31:34,003 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-09-07 11:31:34,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:34,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:34,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:34,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:31:34,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:31:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:31:34,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:31:34,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-07 11:31:34,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:31:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:31:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:31:34,075 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand 26 states. [2019-09-07 11:31:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:31:46,732 INFO L93 Difference]: Finished difference Result 401 states and 528 transitions. [2019-09-07 11:31:46,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:31:46,733 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2019-09-07 11:31:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:31:46,744 INFO L225 Difference]: With dead ends: 401 [2019-09-07 11:31:46,744 INFO L226 Difference]: Without dead ends: 399 [2019-09-07 11:31:46,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=2464, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 11:31:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-07 11:31:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 170. [2019-09-07 11:31:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-07 11:31:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 217 transitions. [2019-09-07 11:31:46,818 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 217 transitions. Word has length 67 [2019-09-07 11:31:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:31:46,820 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 217 transitions. [2019-09-07 11:31:46,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:31:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 217 transitions. [2019-09-07 11:31:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 11:31:46,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:31:46,828 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:31:46,828 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:31:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:31:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash -578961708, now seen corresponding path program 5 times [2019-09-07 11:31:46,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:31:46,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:31:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:46,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:31:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:31:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 11:31:47,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:31:47,261 INFO L223 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-09-07 11:31:47,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:31:47,319 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 11:31:47,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:31:47,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:31:47,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:31:47,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:31:47,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:31:47,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:31:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 11:31:47,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:31:47,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-09-07 11:31:47,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:31:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:31:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:31:47,641 INFO L87 Difference]: Start difference. First operand 170 states and 217 transitions. Second operand 22 states. [2019-09-07 11:31:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:31:48,103 INFO L93 Difference]: Finished difference Result 254 states and 313 transitions. [2019-09-07 11:31:48,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:31:48,104 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2019-09-07 11:31:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:31:48,105 INFO L225 Difference]: With dead ends: 254 [2019-09-07 11:31:48,106 INFO L226 Difference]: Without dead ends: 195 [2019-09-07 11:31:48,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:31:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-07 11:31:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2019-09-07 11:31:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-07 11:31:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2019-09-07 11:31:48,128 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 75 [2019-09-07 11:31:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:31:48,128 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2019-09-07 11:31:48,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:31:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2019-09-07 11:31:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 11:31:48,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:31:48,130 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:31:48,130 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:31:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:31:48,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1207960265, now seen corresponding path program 6 times [2019-09-07 11:31:48,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:31:48,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:31:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:48,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:31:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:31:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:31:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 11:31:48,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:31:48,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:31:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:31:48,378 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-07 11:31:48,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:31:48,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:31:48,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:31:48,481 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-09-07 11:31:48,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:48,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:48,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:48,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-09-07 11:31:49,028 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:31:49,029 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-09-07 11:31:49,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:49,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:49,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:49,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-09-07 11:31:50,955 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-09-07 11:31:50,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:31:50,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:31:50,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:31:50,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-09-07 11:31:50,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:31:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 67 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-07 11:31:51,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:31:51,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-09-07 11:31:51,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:31:51,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:31:51,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:31:51,035 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand 29 states. [2019-09-07 11:34:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:34:19,495 INFO L93 Difference]: Finished difference Result 560 states and 779 transitions. [2019-09-07 11:34:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 11:34:19,495 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2019-09-07 11:34:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:34:19,499 INFO L225 Difference]: With dead ends: 560 [2019-09-07 11:34:19,500 INFO L226 Difference]: Without dead ends: 558 [2019-09-07 11:34:19,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=456, Invalid=2957, Unknown=9, NotChecked=0, Total=3422 [2019-09-07 11:34:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-07 11:34:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 239. [2019-09-07 11:34:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-07 11:34:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 312 transitions. [2019-09-07 11:34:19,541 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 312 transitions. Word has length 89 [2019-09-07 11:34:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:34:19,541 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 312 transitions. [2019-09-07 11:34:19,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:34:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 312 transitions. [2019-09-07 11:34:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 11:34:19,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:34:19,543 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:34:19,544 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:34:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:34:19,544 INFO L82 PathProgramCache]: Analyzing trace with hash 854871883, now seen corresponding path program 2 times [2019-09-07 11:34:19,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:34:19,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:34:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:19,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:34:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 11:34:19,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:34:19,844 INFO L223 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-09-07 11:34:19,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:34:19,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:34:19,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:34:19,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:34:19,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:34:20,013 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-09-07 11:34:20,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:20,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:20,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:20,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:34:20,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:34:20,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, 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-09-07 11:34:20,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:20,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:20,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:20,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-09-07 11:34:20,458 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-09-07 11:34:20,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:20,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:20,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:20,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-09-07 11:34:20,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 67 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:34:20,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:34:20,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-09-07 11:34:20,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:34:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:34:20,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:34:20,545 INFO L87 Difference]: Start difference. First operand 239 states and 312 transitions. Second operand 30 states. [2019-09-07 11:34:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:34:25,580 INFO L93 Difference]: Finished difference Result 584 states and 803 transitions. [2019-09-07 11:34:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 11:34:25,580 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2019-09-07 11:34:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:34:25,584 INFO L225 Difference]: With dead ends: 584 [2019-09-07 11:34:25,585 INFO L226 Difference]: Without dead ends: 582 [2019-09-07 11:34:25,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=558, Invalid=3864, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:34:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-07 11:34:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 296. [2019-09-07 11:34:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-07 11:34:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 376 transitions. [2019-09-07 11:34:25,641 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 376 transitions. Word has length 89 [2019-09-07 11:34:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:34:25,642 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 376 transitions. [2019-09-07 11:34:25,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:34:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2019-09-07 11:34:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 11:34:25,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:34:25,645 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:34:25,645 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:34:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:34:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 831831990, now seen corresponding path program 7 times [2019-09-07 11:34:25,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:34:25,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:34:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:25,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:34:25,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 11:34:25,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:34:25,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:34:25,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:34:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:25,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:34:25,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:34:25,937 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-09-07 11:34:25,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:25,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:25,949 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-09-07 11:34:25,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-09-07 11:34:26,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:26,091 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-09-07 11:34:26,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:26,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:34:26,104 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-09-07 11:34:26,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:26,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-09-07 11:34:26,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 11:34:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:34:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 22 [2019-09-07 11:34:26,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:34:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:34:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:34:26,148 INFO L87 Difference]: Start difference. First operand 296 states and 376 transitions. Second operand 22 states. [2019-09-07 11:34:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:34:29,590 INFO L93 Difference]: Finished difference Result 1118 states and 1618 transitions. [2019-09-07 11:34:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 11:34:29,590 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2019-09-07 11:34:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:34:29,597 INFO L225 Difference]: With dead ends: 1118 [2019-09-07 11:34:29,597 INFO L226 Difference]: Without dead ends: 1116 [2019-09-07 11:34:29,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=663, Invalid=4887, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 11:34:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-07 11:34:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 552. [2019-09-07 11:34:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-07 11:34:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 756 transitions. [2019-09-07 11:34:29,698 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 756 transitions. Word has length 97 [2019-09-07 11:34:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:34:29,699 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 756 transitions. [2019-09-07 11:34:29,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:34:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 756 transitions. [2019-09-07 11:34:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 11:34:29,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:34:29,704 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:34:29,704 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:34:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:34:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 816313272, now seen corresponding path program 2 times [2019-09-07 11:34:29,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:34:29,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:34:29,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:29,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:34:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 11:34:30,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:34:30,027 INFO L223 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-09-07 11:34:30,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:34:30,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:34:30,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:34:30,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:34:30,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:34:30,190 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-09-07 11:34:30,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:30,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:30,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:30,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-09-07 11:34:30,752 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-09-07 11:34:30,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:30,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:30,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:30,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-09-07 11:34:30,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 11:34:30,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:34:30,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-09-07 11:34:30,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:34:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:34:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:34:30,943 INFO L87 Difference]: Start difference. First operand 552 states and 756 transitions. Second operand 32 states. [2019-09-07 11:34:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:34:37,170 INFO L93 Difference]: Finished difference Result 1286 states and 1803 transitions. [2019-09-07 11:34:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 11:34:37,171 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2019-09-07 11:34:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:34:37,177 INFO L225 Difference]: With dead ends: 1286 [2019-09-07 11:34:37,178 INFO L226 Difference]: Without dead ends: 1284 [2019-09-07 11:34:37,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=773, Invalid=5547, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 11:34:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-07 11:34:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 399. [2019-09-07 11:34:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-07 11:34:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-09-07 11:34:37,273 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 97 [2019-09-07 11:34:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:34:37,273 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-09-07 11:34:37,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:34:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-09-07 11:34:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 11:34:37,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:34:37,277 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:34:37,277 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:34:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:34:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash -871874653, now seen corresponding path program 8 times [2019-09-07 11:34:37,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:34:37,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:34:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:37,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:34:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 63 proven. 48 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 11:34:37,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:34:37,882 INFO L223 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-09-07 11:34:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:34:37,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:34:37,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:34:37,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:34:37,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:34:38,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:34:38,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:38,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 84 proven. 27 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 11:34:38,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:34:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-09-07 11:34:38,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:34:38,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:34:38,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:34:38,326 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 28 states. [2019-09-07 11:34:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:34:39,051 INFO L93 Difference]: Finished difference Result 525 states and 666 transitions. [2019-09-07 11:34:39,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:34:39,051 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 105 [2019-09-07 11:34:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:34:39,054 INFO L225 Difference]: With dead ends: 525 [2019-09-07 11:34:39,054 INFO L226 Difference]: Without dead ends: 423 [2019-09-07 11:34:39,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:34:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-07 11:34:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 399. [2019-09-07 11:34:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-07 11:34:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 518 transitions. [2019-09-07 11:34:39,115 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 518 transitions. Word has length 105 [2019-09-07 11:34:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:34:39,115 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 518 transitions. [2019-09-07 11:34:39,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:34:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 518 transitions. [2019-09-07 11:34:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 11:34:39,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:34:39,118 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:34:39,118 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:34:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:34:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1446701272, now seen corresponding path program 9 times [2019-09-07 11:34:39,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:34:39,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:34:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:39,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:34:39,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 12 proven. 124 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 11:34:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:34:39,368 INFO L223 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-09-07 11:34:39,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:34:39,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:34:39,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:34:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 11:34:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:34:39,557 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-09-07 11:34:39,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:39,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:39,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:39,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-09-07 11:34:40,182 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:34:40,182 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-09-07 11:34:40,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:40,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:40,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:40,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-09-07 11:34:45,066 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-09-07 11:34:45,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:45,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:45,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:45,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-09-07 11:34:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 21 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 11:34:45,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:34:45,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-09-07 11:34:45,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 11:34:45,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 11:34:45,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:34:45,167 INFO L87 Difference]: Start difference. First operand 399 states and 518 transitions. Second operand 35 states. [2019-09-07 11:35:08,833 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 11:35:18,010 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-07 11:35:32,196 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 11:35:52,389 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 11:36:21,689 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-09-07 11:41:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:44,402 INFO L93 Difference]: Finished difference Result 2338 states and 3435 transitions. [2019-09-07 11:41:44,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-07 11:41:44,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2019-09-07 11:41:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:44,414 INFO L225 Difference]: With dead ends: 2338 [2019-09-07 11:41:44,415 INFO L226 Difference]: Without dead ends: 2336 [2019-09-07 11:41:44,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 91 SyntacticMatches, 15 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9274 ImplicationChecksByTransitivity, 121.0s TimeCoverageRelationStatistics Valid=2541, Invalid=21278, Unknown=51, NotChecked=0, Total=23870 [2019-09-07 11:41:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-09-07 11:41:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1337. [2019-09-07 11:41:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-07 11:41:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1928 transitions. [2019-09-07 11:41:44,695 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1928 transitions. Word has length 119 [2019-09-07 11:41:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:44,695 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1928 transitions. [2019-09-07 11:41:44,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 11:41:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1928 transitions. [2019-09-07 11:41:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 11:41:44,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:44,702 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:44,702 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1029304666, now seen corresponding path program 3 times [2019-09-07 11:41:44,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:44,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:44,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:44,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:41:44,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 12 proven. 124 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 11:41:45,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:45,128 INFO L223 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-09-07 11:41:45,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:41:45,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:41:45,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:41:45,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:41:45,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:45,321 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-09-07 11:41:45,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:45,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:45,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:45,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:41:45,487 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:41:45,488 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-09-07 11:41:45,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:45,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:45,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:45,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-07 11:41:46,298 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-09-07 11:41:46,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:46,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:46,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:46,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:41:46,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 21 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 11:41:46,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:46,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-09-07 11:41:46,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:41:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:41:46,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:41:46,413 INFO L87 Difference]: Start difference. First operand 1337 states and 1928 transitions. Second operand 36 states. [2019-09-07 11:42:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:51,529 INFO L93 Difference]: Finished difference Result 2439 states and 3508 transitions. [2019-09-07 11:42:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 11:42:51,529 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 119 [2019-09-07 11:42:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:51,541 INFO L225 Difference]: With dead ends: 2439 [2019-09-07 11:42:51,541 INFO L226 Difference]: Without dead ends: 2437 [2019-09-07 11:42:51,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 91 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2724 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=986, Invalid=7756, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 11:42:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-09-07 11:42:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1589. [2019-09-07 11:42:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2019-09-07 11:42:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2271 transitions. [2019-09-07 11:42:51,847 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2271 transitions. Word has length 119 [2019-09-07 11:42:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:51,848 INFO L475 AbstractCegarLoop]: Abstraction has 1589 states and 2271 transitions. [2019-09-07 11:42:51,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:42:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2271 transitions. [2019-09-07 11:42:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 11:42:51,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:51,856 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:51,856 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1853086011, now seen corresponding path program 10 times [2019-09-07 11:42:51,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:51,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:51,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:42:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-07 11:42:52,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:52,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:42:52,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:42:52,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:42:52,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:42:52,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:42:52,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:52,275 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-09-07 11:42:52,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:52,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:52,317 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-09-07 11:42:52,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-09-07 11:42:52,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:52,571 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-09-07 11:42:52,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:42:52,591 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-09-07 11:42:52,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:52,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-09-07 11:42:52,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-07 11:42:52,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:42:52,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 27 [2019-09-07 11:42:52,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:42:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:42:52,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:42:52,716 INFO L87 Difference]: Start difference. First operand 1589 states and 2271 transitions. Second operand 27 states. [2019-09-07 11:43:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:43:07,667 INFO L93 Difference]: Finished difference Result 5522 states and 8267 transitions. [2019-09-07 11:43:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-09-07 11:43:07,668 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2019-09-07 11:43:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:43:07,692 INFO L225 Difference]: With dead ends: 5522 [2019-09-07 11:43:07,692 INFO L226 Difference]: Without dead ends: 5520 [2019-09-07 11:43:07,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25096 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4746, Invalid=53576, Unknown=0, NotChecked=0, Total=58322 [2019-09-07 11:43:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5520 states. [2019-09-07 11:43:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5520 to 2404. [2019-09-07 11:43:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2404 states. [2019-09-07 11:43:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 3475 transitions. [2019-09-07 11:43:08,301 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 3475 transitions. Word has length 127 [2019-09-07 11:43:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:43:08,302 INFO L475 AbstractCegarLoop]: Abstraction has 2404 states and 3475 transitions. [2019-09-07 11:43:08,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:43:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 3475 transitions. [2019-09-07 11:43:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 11:43:08,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:43:08,313 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:43:08,313 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:43:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:43:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash 755701447, now seen corresponding path program 3 times [2019-09-07 11:43:08,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:43:08,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:43:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:08,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:43:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:43:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:43:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-07 11:43:08,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:43:08,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:43:08,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:43:08,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:43:08,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:43:08,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:43:08,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:43:08,929 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-09-07 11:43:08,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:43:08,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:08,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:43:08,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:43:09,670 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-09-07 11:43:09,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:43:09,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:43:09,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:43:09,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:43:09,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:43:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-07 11:43:09,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:43:09,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-09-07 11:43:09,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 11:43:09,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 11:43:09,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:43:09,780 INFO L87 Difference]: Start difference. First operand 2404 states and 3475 transitions. Second operand 38 states. [2019-09-07 11:44:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:44:10,000 INFO L93 Difference]: Finished difference Result 4859 states and 7047 transitions. [2019-09-07 11:44:10,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 11:44:10,000 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 127 [2019-09-07 11:44:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:44:10,021 INFO L225 Difference]: With dead ends: 4859 [2019-09-07 11:44:10,022 INFO L226 Difference]: Without dead ends: 4857 [2019-09-07 11:44:10,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 98 SyntacticMatches, 13 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3951 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1326, Invalid=11106, Unknown=0, NotChecked=0, Total=12432 [2019-09-07 11:44:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2019-09-07 11:44:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 1826. [2019-09-07 11:44:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-09-07 11:44:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2702 transitions. [2019-09-07 11:44:10,496 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2702 transitions. Word has length 127 [2019-09-07 11:44:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:44:10,496 INFO L475 AbstractCegarLoop]: Abstraction has 1826 states and 2702 transitions. [2019-09-07 11:44:10,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 11:44:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2702 transitions. [2019-09-07 11:44:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 11:44:10,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:44:10,504 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:44:10,505 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:44:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:44:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2108368818, now seen corresponding path program 11 times [2019-09-07 11:44:10,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:44:10,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:44:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:10,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:44:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:44:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 115 proven. 81 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 11:44:11,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:44:11,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:44:11,237 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:44:11,315 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-07 11:44:11,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:44:11,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:44:11,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:44:11,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:44:11,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:44:11,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:44:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 144 proven. 52 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 11:44:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:44:11,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2019-09-07 11:44:11,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 11:44:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 11:44:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:44:11,966 INFO L87 Difference]: Start difference. First operand 1826 states and 2702 transitions. Second operand 34 states. [2019-09-07 11:44:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:44:13,002 INFO L93 Difference]: Finished difference Result 1951 states and 2828 transitions. [2019-09-07 11:44:13,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:44:13,002 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-09-07 11:44:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:44:13,012 INFO L225 Difference]: With dead ends: 1951 [2019-09-07 11:44:13,012 INFO L226 Difference]: Without dead ends: 1826 [2019-09-07 11:44:13,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=398, Invalid=1324, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 11:44:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2019-09-07 11:44:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1826. [2019-09-07 11:44:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-09-07 11:44:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2679 transitions. [2019-09-07 11:44:13,503 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2679 transitions. Word has length 135 [2019-09-07 11:44:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:44:13,503 INFO L475 AbstractCegarLoop]: Abstraction has 1826 states and 2679 transitions. [2019-09-07 11:44:13,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 11:44:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2679 transitions. [2019-09-07 11:44:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 11:44:13,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:44:13,513 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:44:13,513 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:44:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:44:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1530821081, now seen corresponding path program 12 times [2019-09-07 11:44:13,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:44:13,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:44:13,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:13,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:44:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:44:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:44:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 16 proven. 213 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 11:44:13,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:44:13,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:44:13,982 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:44:14,122 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 11:44:14,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:44:14,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 11:44:14,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:44:14,294 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-09-07 11:44:14,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:14,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:44:14,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-09-07 11:44:14,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-09-07 11:44:15,482 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:44:15,482 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-09-07 11:44:15,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:15,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:44:15,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:15,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-09-07 11:44:23,220 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-09-07 11:44:23,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:44:23,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:44:23,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:44:23,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-09-07 11:44:23,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:44:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 27 proven. 229 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-07 11:44:23,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:44:23,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2019-09-07 11:44:23,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 11:44:23,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 11:44:23,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1484, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 11:44:23,354 INFO L87 Difference]: Start difference. First operand 1826 states and 2679 transitions. Second operand 41 states.