./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9722a10940ebd7a5d75170225a40cd37454d0528 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 10:46:36,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:46:36,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:46:36,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:46:36,444 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:46:36,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:46:36,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:46:36,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:46:36,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:46:36,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:46:36,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:46:36,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:46:36,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:46:36,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:46:36,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:46:36,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:46:36,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:46:36,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:46:36,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:46:36,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:46:36,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:46:36,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:46:36,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:46:36,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:46:36,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:46:36,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:46:36,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:46:36,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:46:36,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:46:36,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:46:36,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:46:36,490 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:46:36,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:46:36,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:46:36,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:46:36,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:46:36,493 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:46:36,519 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:46:36,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:46:36,524 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:46:36,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:46:36,525 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:46:36,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:46:36,526 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:46:36,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:46:36,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:46:36,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:46:36,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:46:36,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:46:36,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:46:36,528 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:46:36,528 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:46:36,528 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:46:36,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:46:36,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:46:36,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:46:36,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:46:36,529 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:46:36,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:46:36,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:46:36,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:46:36,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:46:36,533 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:46:36,533 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:46:36,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:46:36,533 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2019-01-12 10:46:36,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:46:36,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:46:36,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:46:36,618 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:46:36,618 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:46:36,619 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2019-01-12 10:46:36,686 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717d61348/0c5160eb5fd64087a5a59b25bf368fbb/FLAG15f10a2db [2019-01-12 10:46:37,115 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:46:37,116 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2019-01-12 10:46:37,122 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717d61348/0c5160eb5fd64087a5a59b25bf368fbb/FLAG15f10a2db [2019-01-12 10:46:37,489 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717d61348/0c5160eb5fd64087a5a59b25bf368fbb [2019-01-12 10:46:37,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:46:37,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:46:37,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:46:37,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:46:37,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:46:37,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c73574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37, skipping insertion in model container [2019-01-12 10:46:37,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:46:37,537 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:46:37,766 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:46:37,772 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:46:37,801 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:46:37,823 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:46:37,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37 WrapperNode [2019-01-12 10:46:37,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:46:37,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:46:37,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:46:37,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:46:37,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:46:37,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:46:37,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:46:37,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:46:37,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (1/1) ... [2019-01-12 10:46:37,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:46:37,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:46:37,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:46:37,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:46:37,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (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-01-12 10:46:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 10:46:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:46:38,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:46:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 10:46:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:46:38,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:46:38,432 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:46:38,433 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 10:46:38,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:46:38 BoogieIcfgContainer [2019-01-12 10:46:38,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:46:38,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:46:38,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:46:38,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:46:38,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:46:37" (1/3) ... [2019-01-12 10:46:38,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719e3b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:46:38, skipping insertion in model container [2019-01-12 10:46:38,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:37" (2/3) ... [2019-01-12 10:46:38,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719e3b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:46:38, skipping insertion in model container [2019-01-12 10:46:38,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:46:38" (3/3) ... [2019-01-12 10:46:38,444 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2019-01-12 10:46:38,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:46:38,463 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:46:38,481 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:46:38,513 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:46:38,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:46:38,514 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:46:38,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:46:38,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:46:38,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:46:38,515 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:46:38,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:46:38,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:46:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-12 10:46:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 10:46:38,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:38,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:38,542 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:38,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1808788559, now seen corresponding path program 1 times [2019-01-12 10:46:38,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:38,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:38,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:38,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:46:38,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 10:46:38,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:46:38,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:46:38,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:46:38,942 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-01-12 10:46:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:39,167 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-01-12 10:46:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:46:39,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-12 10:46:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:39,179 INFO L225 Difference]: With dead ends: 54 [2019-01-12 10:46:39,179 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 10:46:39,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:46:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 10:46:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-01-12 10:46:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 10:46:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-12 10:46:39,218 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 7 [2019-01-12 10:46:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:39,218 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-12 10:46:39,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:46:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-12 10:46:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 10:46:39,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:39,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:39,220 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash 616714882, now seen corresponding path program 1 times [2019-01-12 10:46:39,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:39,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:39,810 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-01-12 10:46:39,932 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-12 10:46:40,162 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2019-01-12 10:46:40,510 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-12 10:46:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:40,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:40,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 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-01-12 10:46:40,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:40,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:41,027 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:46:41,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:41,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:46:41,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:41,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:41,070 INFO L267 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-01-12 10:46:41,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-12 10:46:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:41,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-01-12 10:46:41,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 10:46:41,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 10:46:41,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-01-12 10:46:41,174 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 16 states. [2019-01-12 10:46:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:42,156 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-01-12 10:46:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 10:46:42,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2019-01-12 10:46:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:42,158 INFO L225 Difference]: With dead ends: 71 [2019-01-12 10:46:42,158 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 10:46:42,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-01-12 10:46:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 10:46:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-12 10:46:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 10:46:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-01-12 10:46:42,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 13 [2019-01-12 10:46:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:42,171 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-12 10:46:42,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 10:46:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-01-12 10:46:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 10:46:42,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:42,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:42,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:42,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1296773252, now seen corresponding path program 1 times [2019-01-12 10:46:42,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:42,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:42,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:42,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:42,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:46:42,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 10:46:42,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:46:42,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:46:42,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:46:42,220 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2019-01-12 10:46:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:42,319 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2019-01-12 10:46:42,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:46:42,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-12 10:46:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:42,324 INFO L225 Difference]: With dead ends: 83 [2019-01-12 10:46:42,324 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 10:46:42,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:46:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 10:46:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-01-12 10:46:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 10:46:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-01-12 10:46:42,333 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 13 [2019-01-12 10:46:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:42,334 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-12 10:46:42,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:46:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-01-12 10:46:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 10:46:42,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:42,335 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:42,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:42,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:42,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2022971496, now seen corresponding path program 1 times [2019-01-12 10:46:42,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:42,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:42,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:42,570 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-01-12 10:46:42,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:42,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:42,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:42,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-12 10:46:42,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 10:46:42,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 10:46:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:46:42,702 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 9 states. [2019-01-12 10:46:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:43,120 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-01-12 10:46:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:46:43,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-12 10:46:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:43,122 INFO L225 Difference]: With dead ends: 60 [2019-01-12 10:46:43,122 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 10:46:43,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-12 10:46:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 10:46:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-01-12 10:46:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 10:46:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-01-12 10:46:43,130 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2019-01-12 10:46:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:43,130 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-01-12 10:46:43,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 10:46:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-01-12 10:46:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 10:46:43,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:43,131 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:43,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:43,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:43,132 INFO L82 PathProgramCache]: Analyzing trace with hash 958971857, now seen corresponding path program 1 times [2019-01-12 10:46:43,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:43,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:43,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:43,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:43,872 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-01-12 10:46:43,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:43,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:44,127 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:46:44,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:44,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 47 [2019-01-12 10:46:44,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:44,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:44,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:44,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-01-12 10:46:44,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:44,660 INFO L478 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 50 treesize of output 52 [2019-01-12 10:46:44,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:44,666 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:46:44,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-12 10:46:44,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:44,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:44,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:46:44,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-01-12 10:46:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:44,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:44,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-01-12 10:46:44,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 10:46:44,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 10:46:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-01-12 10:46:44,816 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 25 states. [2019-01-12 10:46:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:45,526 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-01-12 10:46:45,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 10:46:45,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-01-12 10:46:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:45,529 INFO L225 Difference]: With dead ends: 77 [2019-01-12 10:46:45,529 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 10:46:45,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 10:46:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 10:46:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-01-12 10:46:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 10:46:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-01-12 10:46:45,537 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2019-01-12 10:46:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:45,537 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-01-12 10:46:45,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 10:46:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-01-12 10:46:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 10:46:45,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:45,538 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:45,539 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:45,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:45,539 INFO L82 PathProgramCache]: Analyzing trace with hash 632161909, now seen corresponding path program 2 times [2019-01-12 10:46:45,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:45,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:45,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:45,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:45,893 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2019-01-12 10:46:46,445 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-01-12 10:46:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:46,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:46,726 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:46:46,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:46:46,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:46:46,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:46,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:47,076 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:46:47,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:47,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:46:47,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:47,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:47,164 INFO L267 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-01-12 10:46:47,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-01-12 10:46:47,224 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:46:47,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:47,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:47,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:47,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:46:47,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:47,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:47,263 INFO L267 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-01-12 10:46:47,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-01-12 10:46:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:47,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-01-12 10:46:47,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 10:46:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 10:46:47,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-01-12 10:46:47,329 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 18 states. [2019-01-12 10:46:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:48,218 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2019-01-12 10:46:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 10:46:48,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-01-12 10:46:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:48,220 INFO L225 Difference]: With dead ends: 111 [2019-01-12 10:46:48,221 INFO L226 Difference]: Without dead ends: 94 [2019-01-12 10:46:48,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2019-01-12 10:46:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-12 10:46:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2019-01-12 10:46:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 10:46:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-01-12 10:46:48,233 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 19 [2019-01-12 10:46:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:48,233 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-01-12 10:46:48,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 10:46:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-01-12 10:46:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 10:46:48,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:48,234 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:48,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash 44460555, now seen corresponding path program 2 times [2019-01-12 10:46:48,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:48,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:48,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:48,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:48,637 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-01-12 10:46:48,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:46:48,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:46:48,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:48,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:49,169 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-12 10:46:49,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:49,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 27 [2019-01-12 10:46:49,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:49,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:49,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:49,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-12 10:46:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:49,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:49,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-01-12 10:46:49,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 10:46:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 10:46:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-01-12 10:46:49,343 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 24 states. [2019-01-12 10:46:49,935 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-12 10:46:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:50,268 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2019-01-12 10:46:50,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 10:46:50,269 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-01-12 10:46:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:50,270 INFO L225 Difference]: With dead ends: 118 [2019-01-12 10:46:50,270 INFO L226 Difference]: Without dead ends: 101 [2019-01-12 10:46:50,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 10:46:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-12 10:46:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2019-01-12 10:46:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-12 10:46:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2019-01-12 10:46:50,283 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 23 [2019-01-12 10:46:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:50,283 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-01-12 10:46:50,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 10:46:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2019-01-12 10:46:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 10:46:50,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:50,284 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:50,285 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:50,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash -55202372, now seen corresponding path program 1 times [2019-01-12 10:46:50,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:50,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:50,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:50,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:50,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:51,220 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-01-12 10:46:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:51,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:51,342 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-01-12 10:46:51,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:51,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:51,468 INFO L478 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-01-12 10:46:51,620 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-12 10:46:51,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:51,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-12 10:46:51,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:51,628 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-12 10:46:51,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:51,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:51,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:51,640 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:17 [2019-01-12 10:46:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:51,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:51,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2019-01-12 10:46:51,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 10:46:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 10:46:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-01-12 10:46:51,691 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 18 states. [2019-01-12 10:46:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:53,783 INFO L93 Difference]: Finished difference Result 229 states and 285 transitions. [2019-01-12 10:46:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 10:46:53,784 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-01-12 10:46:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:53,785 INFO L225 Difference]: With dead ends: 229 [2019-01-12 10:46:53,785 INFO L226 Difference]: Without dead ends: 212 [2019-01-12 10:46:53,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=630, Invalid=2676, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 10:46:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-12 10:46:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 101. [2019-01-12 10:46:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-12 10:46:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2019-01-12 10:46:53,807 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 24 [2019-01-12 10:46:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:53,808 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2019-01-12 10:46:53,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 10:46:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2019-01-12 10:46:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 10:46:53,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:53,809 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:53,809 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash 624855998, now seen corresponding path program 2 times [2019-01-12 10:46:53,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:53,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:53,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:53,930 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:46:53,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:46:53,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:46:53,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:53,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:54,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:54,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 10:46:54,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 10:46:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 10:46:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:46:54,013 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 7 states. [2019-01-12 10:46:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:54,173 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2019-01-12 10:46:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 10:46:54,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-12 10:46:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:54,176 INFO L225 Difference]: With dead ends: 201 [2019-01-12 10:46:54,179 INFO L226 Difference]: Without dead ends: 140 [2019-01-12 10:46:54,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:46:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-12 10:46:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2019-01-12 10:46:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-12 10:46:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2019-01-12 10:46:54,223 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 24 [2019-01-12 10:46:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:54,224 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2019-01-12 10:46:54,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 10:46:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2019-01-12 10:46:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 10:46:54,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:54,225 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:54,231 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash 802880644, now seen corresponding path program 3 times [2019-01-12 10:46:54,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:54,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:54,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:54,819 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2019-01-12 10:46:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:55,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:55,328 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:46:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:46:55,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 10:46:55,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:55,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:55,627 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:46:55,652 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:46:55,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:55,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-12 10:46:55,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:55,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:55,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:55,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-01-12 10:46:56,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:56,169 INFO L478 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 51 treesize of output 53 [2019-01-12 10:46:56,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:56,173 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:46:56,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-12 10:46:56,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:56,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:56,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:56,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-01-12 10:46:56,379 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-12 10:46:56,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:56,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:56,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:56,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:56,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-12 10:46:56,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:56,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:56,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:46:56,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:36 [2019-01-12 10:46:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:56,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 22 [2019-01-12 10:46:56,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 10:46:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 10:46:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-01-12 10:46:56,485 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 22 states. [2019-01-12 10:46:57,691 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-01-12 10:46:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:57,739 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2019-01-12 10:46:57,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 10:46:57,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-01-12 10:46:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:57,741 INFO L225 Difference]: With dead ends: 155 [2019-01-12 10:46:57,741 INFO L226 Difference]: Without dead ends: 153 [2019-01-12 10:46:57,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 10:46:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-12 10:46:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2019-01-12 10:46:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-12 10:46:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2019-01-12 10:46:57,761 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 24 [2019-01-12 10:46:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:57,761 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2019-01-12 10:46:57,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 10:46:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2019-01-12 10:46:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 10:46:57,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:57,762 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:57,763 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash 519508641, now seen corresponding path program 3 times [2019-01-12 10:46:57,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:57,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:57,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:57,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:57,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:57,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:57,989 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-01-12 10:46:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:46:58,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 10:46:58,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:58,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:58,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:58,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-01-12 10:46:58,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 10:46:58,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 10:46:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-01-12 10:46:58,108 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand 12 states. [2019-01-12 10:46:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:58,306 INFO L93 Difference]: Finished difference Result 189 states and 230 transitions. [2019-01-12 10:46:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 10:46:58,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-12 10:46:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:58,307 INFO L225 Difference]: With dead ends: 189 [2019-01-12 10:46:58,307 INFO L226 Difference]: Without dead ends: 173 [2019-01-12 10:46:58,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-12 10:46:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-12 10:46:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-01-12 10:46:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-12 10:46:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 157 transitions. [2019-01-12 10:46:58,331 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 157 transitions. Word has length 27 [2019-01-12 10:46:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:58,331 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 157 transitions. [2019-01-12 10:46:58,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 10:46:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 157 transitions. [2019-01-12 10:46:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 10:46:58,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:58,335 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:58,335 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash 862655954, now seen corresponding path program 1 times [2019-01-12 10:46:58,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:58,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:58,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:58,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:58,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:58,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:58,893 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-01-12 10:46:58,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:58,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:59,051 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:46:59,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:59,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 47 [2019-01-12 10:46:59,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:59,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:59,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:59,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-01-12 10:46:59,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:59,205 INFO L478 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 43 treesize of output 45 [2019-01-12 10:46:59,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:46:59,220 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:46:59,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2019-01-12 10:46:59,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:46:59,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:46:59,282 INFO L267 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-01-12 10:46:59,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-12 10:46:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:59,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:59,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-01-12 10:46:59,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 10:46:59,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 10:46:59,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2019-01-12 10:46:59,545 INFO L87 Difference]: Start difference. First operand 129 states and 157 transitions. Second operand 31 states. [2019-01-12 10:47:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:00,725 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2019-01-12 10:47:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 10:47:00,726 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 28 [2019-01-12 10:47:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:00,727 INFO L225 Difference]: With dead ends: 146 [2019-01-12 10:47:00,727 INFO L226 Difference]: Without dead ends: 137 [2019-01-12 10:47:00,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 10:47:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-12 10:47:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2019-01-12 10:47:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-12 10:47:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-01-12 10:47:00,745 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 28 [2019-01-12 10:47:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:00,745 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-01-12 10:47:00,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 10:47:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-01-12 10:47:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 10:47:00,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:00,747 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:00,747 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:00,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1474562622, now seen corresponding path program 4 times [2019-01-12 10:47:00,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:00,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:00,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:00,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:01,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:01,149 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:01,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:47:01,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:47:01,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:01,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:01,244 INFO L478 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 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 10:47:01,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2019-01-12 10:47:01,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-01-12 10:47:01,716 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:01,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:01,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:01,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-01-12 10:47:01,834 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:47:01,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:01,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:01,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:01,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:47:01,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:01,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-01-12 10:47:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:02,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:02,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-01-12 10:47:02,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 10:47:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 10:47:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-01-12 10:47:02,049 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 29 states. [2019-01-12 10:47:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:03,518 INFO L93 Difference]: Finished difference Result 259 states and 317 transitions. [2019-01-12 10:47:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 10:47:03,519 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-12 10:47:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:03,521 INFO L225 Difference]: With dead ends: 259 [2019-01-12 10:47:03,521 INFO L226 Difference]: Without dead ends: 194 [2019-01-12 10:47:03,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 10:47:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-12 10:47:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2019-01-12 10:47:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-12 10:47:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2019-01-12 10:47:03,545 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 29 [2019-01-12 10:47:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:03,547 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2019-01-12 10:47:03,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 10:47:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2019-01-12 10:47:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 10:47:03,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:03,551 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:03,551 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 219109591, now seen corresponding path program 4 times [2019-01-12 10:47:03,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:03,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:03,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:04,069 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-12 10:47:04,315 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-01-12 10:47:04,878 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-12 10:47:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:04,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:04,960 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-01-12 10:47:04,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:47:04,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:47:04,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:04,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:05,158 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:47:05,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:05,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 47 [2019-01-12 10:47:05,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:05,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:05,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:05,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-01-12 10:47:05,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:05,285 INFO L478 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 50 treesize of output 52 [2019-01-12 10:47:05,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:05,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:05,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-12 10:47:05,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:05,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:05,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:47:05,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2019-01-12 10:47:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 10:47:05,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:05,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-01-12 10:47:05,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 10:47:05,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 10:47:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-01-12 10:47:05,447 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand 24 states. [2019-01-12 10:47:05,862 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-12 10:47:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:09,011 INFO L93 Difference]: Finished difference Result 215 states and 262 transitions. [2019-01-12 10:47:09,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 10:47:09,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2019-01-12 10:47:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:09,014 INFO L225 Difference]: With dead ends: 215 [2019-01-12 10:47:09,014 INFO L226 Difference]: Without dead ends: 150 [2019-01-12 10:47:09,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=416, Invalid=2235, Unknown=1, NotChecked=0, Total=2652 [2019-01-12 10:47:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-12 10:47:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2019-01-12 10:47:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-12 10:47:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2019-01-12 10:47:09,036 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 29 [2019-01-12 10:47:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:09,037 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2019-01-12 10:47:09,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 10:47:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2019-01-12 10:47:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 10:47:09,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:09,038 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:09,038 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1586454183, now seen corresponding path program 1 times [2019-01-12 10:47:09,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:09,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:09,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:09,656 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-01-12 10:47:10,074 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-01-12 10:47:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:10,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:10,442 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:10,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:10,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:10,769 INFO L478 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 0 case distinctions, treesize of input 44 treesize of output 35 [2019-01-12 10:47:10,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:10,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-01-12 10:47:10,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:10,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:10,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:10,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:30 [2019-01-12 10:47:10,904 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:47:10,923 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-12 10:47:10,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:10,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:10,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:10,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:10,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2019-01-12 10:47:10,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:10,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:10,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:10,947 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-01-12 10:47:11,003 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:47:11,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:11,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:11,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:11,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:47:11,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:11,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:11,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:11,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-01-12 10:47:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 10:47:11,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:11,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-01-12 10:47:11,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 10:47:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 10:47:11,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-01-12 10:47:11,085 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand 21 states. [2019-01-12 10:47:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:11,889 INFO L93 Difference]: Finished difference Result 238 states and 282 transitions. [2019-01-12 10:47:11,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 10:47:11,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-01-12 10:47:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:11,891 INFO L225 Difference]: With dead ends: 238 [2019-01-12 10:47:11,891 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 10:47:11,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 10:47:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 10:47:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 138. [2019-01-12 10:47:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-12 10:47:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2019-01-12 10:47:11,918 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 30 [2019-01-12 10:47:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:11,918 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2019-01-12 10:47:11,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 10:47:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2019-01-12 10:47:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 10:47:11,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:11,919 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:11,920 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash -828731857, now seen corresponding path program 2 times [2019-01-12 10:47:11,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:11,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:11,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:12,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:12,548 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-01-12 10:47:12,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:47:12,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:47:12,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:12,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:12,772 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:12,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:12,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:12,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:12,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:12,800 INFO L267 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-01-12 10:47:12,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-01-12 10:47:12,889 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:47:12,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:12,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:12,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:12,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:47:12,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:12,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:12,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:12,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2019-01-12 10:47:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:12,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:12,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-01-12 10:47:12,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 10:47:12,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 10:47:12,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-01-12 10:47:12,988 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 23 states. [2019-01-12 10:47:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:14,232 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2019-01-12 10:47:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 10:47:14,233 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-01-12 10:47:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:14,234 INFO L225 Difference]: With dead ends: 239 [2019-01-12 10:47:14,234 INFO L226 Difference]: Without dead ends: 202 [2019-01-12 10:47:14,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 10:47:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-01-12 10:47:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 150. [2019-01-12 10:47:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 10:47:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2019-01-12 10:47:14,262 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 30 [2019-01-12 10:47:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:14,263 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2019-01-12 10:47:14,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 10:47:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2019-01-12 10:47:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 10:47:14,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:14,264 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:14,264 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1196943461, now seen corresponding path program 3 times [2019-01-12 10:47:14,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:14,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:14,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:14,889 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-01-12 10:47:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:15,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:15,565 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-01-12 10:47:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:47:15,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-12 10:47:15,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:15,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:15,835 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:15,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:15,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:15,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:15,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:15,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:15,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-01-12 10:47:15,911 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:47:15,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:15,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:15,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:15,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:47:15,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:15,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:15,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:15,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:29 [2019-01-12 10:47:16,043 INFO L478 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 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-12 10:47:16,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:16,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:16,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:16,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2019-01-12 10:47:16,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:16,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:16,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:16,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2019-01-12 10:47:16,145 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:47:16,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:16,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:16,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:16,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:47:16,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:16,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:16,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:16,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2019-01-12 10:47:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:16,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:16,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 25 [2019-01-12 10:47:16,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 10:47:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 10:47:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-01-12 10:47:16,234 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 25 states. [2019-01-12 10:47:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:17,296 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2019-01-12 10:47:17,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 10:47:17,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-01-12 10:47:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:17,299 INFO L225 Difference]: With dead ends: 287 [2019-01-12 10:47:17,299 INFO L226 Difference]: Without dead ends: 238 [2019-01-12 10:47:17,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 10:47:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-12 10:47:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 168. [2019-01-12 10:47:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-12 10:47:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2019-01-12 10:47:17,329 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 31 [2019-01-12 10:47:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:17,329 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2019-01-12 10:47:17,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 10:47:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2019-01-12 10:47:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 10:47:17,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:17,330 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:17,330 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1597202772, now seen corresponding path program 5 times [2019-01-12 10:47:17,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:17,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:17,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:17,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:17,828 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-12 10:47:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:18,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:18,119 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-01-12 10:47:18,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 10:47:18,162 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-12 10:47:18,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:18,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:18,355 INFO L478 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 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 10:47:18,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2019-01-12 10:47:18,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:18,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:18,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:18,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-01-12 10:47:18,525 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:18,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:18,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:18,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:18,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:18,815 INFO L267 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-01-12 10:47:18,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-12 10:47:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:19,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:19,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-01-12 10:47:19,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 10:47:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 10:47:19,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-01-12 10:47:19,690 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand 32 states. [2019-01-12 10:47:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:21,061 INFO L93 Difference]: Finished difference Result 343 states and 415 transitions. [2019-01-12 10:47:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 10:47:21,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-01-12 10:47:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:21,067 INFO L225 Difference]: With dead ends: 343 [2019-01-12 10:47:21,067 INFO L226 Difference]: Without dead ends: 294 [2019-01-12 10:47:21,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=276, Invalid=2076, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 10:47:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-12 10:47:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 201. [2019-01-12 10:47:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-12 10:47:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2019-01-12 10:47:21,124 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 33 [2019-01-12 10:47:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:21,125 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2019-01-12 10:47:21,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 10:47:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2019-01-12 10:47:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 10:47:21,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:21,127 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:21,127 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:21,130 INFO L82 PathProgramCache]: Analyzing trace with hash -629949587, now seen corresponding path program 1 times [2019-01-12 10:47:21,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:21,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:21,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:21,853 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-12 10:47:22,098 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-12 10:47:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:23,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:23,195 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-01-12 10:47:23,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:23,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:23,314 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:23,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:23,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2019-01-12 10:47:23,388 INFO L478 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 0 case distinctions, treesize of input 40 treesize of output 31 [2019-01-12 10:47:23,395 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:23,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2019-01-12 10:47:23,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-01-12 10:47:23,656 INFO L478 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 0 case distinctions, treesize of input 60 treesize of output 47 [2019-01-12 10:47:23,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,671 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:23,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,674 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:23,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 117 [2019-01-12 10:47:23,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:23,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 10:47:23,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:54 [2019-01-12 10:47:23,921 INFO L478 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 0 case distinctions, treesize of input 56 treesize of output 45 [2019-01-12 10:47:23,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:23,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 125 [2019-01-12 10:47:23,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-12 10:47:23,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:47:24,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-12 10:47:24,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:85 [2019-01-12 10:47:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:24,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:24,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 36 [2019-01-12 10:47:24,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 10:47:24,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 10:47:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 10:47:24,203 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand 36 states. [2019-01-12 10:47:26,341 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-01-12 10:47:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:27,101 INFO L93 Difference]: Finished difference Result 241 states and 289 transitions. [2019-01-12 10:47:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 10:47:27,109 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 33 [2019-01-12 10:47:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:27,110 INFO L225 Difference]: With dead ends: 241 [2019-01-12 10:47:27,111 INFO L226 Difference]: Without dead ends: 232 [2019-01-12 10:47:27,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=437, Invalid=3469, Unknown=0, NotChecked=0, Total=3906 [2019-01-12 10:47:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-01-12 10:47:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2019-01-12 10:47:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-12 10:47:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 259 transitions. [2019-01-12 10:47:27,171 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 259 transitions. Word has length 33 [2019-01-12 10:47:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:27,171 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 259 transitions. [2019-01-12 10:47:27,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 10:47:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 259 transitions. [2019-01-12 10:47:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 10:47:27,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:27,172 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:27,173 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:27,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1109632707, now seen corresponding path program 1 times [2019-01-12 10:47:27,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:27,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:27,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:27,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:27,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:27,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:27,899 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) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:27,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:27,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:28,130 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:28,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:28,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:28,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:28,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:28,152 INFO L267 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-01-12 10:47:28,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-01-12 10:47:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:28,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:28,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-01-12 10:47:28,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 10:47:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 10:47:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-01-12 10:47:28,357 INFO L87 Difference]: Start difference. First operand 214 states and 259 transitions. Second operand 28 states. [2019-01-12 10:47:30,213 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 10:47:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:31,025 INFO L93 Difference]: Finished difference Result 422 states and 506 transitions. [2019-01-12 10:47:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-12 10:47:31,026 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-01-12 10:47:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:31,028 INFO L225 Difference]: With dead ends: 422 [2019-01-12 10:47:31,028 INFO L226 Difference]: Without dead ends: 373 [2019-01-12 10:47:31,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=543, Invalid=3489, Unknown=0, NotChecked=0, Total=4032 [2019-01-12 10:47:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-01-12 10:47:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 234. [2019-01-12 10:47:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-12 10:47:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2019-01-12 10:47:31,088 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 34 [2019-01-12 10:47:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:31,088 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2019-01-12 10:47:31,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 10:47:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2019-01-12 10:47:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 10:47:31,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:31,092 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:31,092 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:31,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:31,093 INFO L82 PathProgramCache]: Analyzing trace with hash -835418939, now seen corresponding path program 2 times [2019-01-12 10:47:31,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:31,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:31,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:31,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:31,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:31,537 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 10:47:31,745 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 10:47:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:32,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:32,230 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-01-12 10:47:32,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:47:32,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:47:32,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:32,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:32,431 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:47:32,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:32,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 47 [2019-01-12 10:47:32,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-01-12 10:47:32,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:32,639 INFO L478 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 51 treesize of output 53 [2019-01-12 10:47:32,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:32,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:32,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-12 10:47:32,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-01-12 10:47:32,781 INFO L478 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 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-12 10:47:32,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:32,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:32,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:32,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:32,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2019-01-12 10:47:32,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:32,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-01-12 10:47:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:33,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:33,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-01-12 10:47:33,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 10:47:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 10:47:33,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 10:47:33,004 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand 36 states. [2019-01-12 10:47:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:33,981 INFO L93 Difference]: Finished difference Result 265 states and 318 transitions. [2019-01-12 10:47:33,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 10:47:33,982 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2019-01-12 10:47:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:33,983 INFO L225 Difference]: With dead ends: 265 [2019-01-12 10:47:33,983 INFO L226 Difference]: Without dead ends: 263 [2019-01-12 10:47:33,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 10:47:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-01-12 10:47:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 231. [2019-01-12 10:47:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-12 10:47:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 281 transitions. [2019-01-12 10:47:34,043 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 281 transitions. Word has length 34 [2019-01-12 10:47:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:34,043 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 281 transitions. [2019-01-12 10:47:34,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 10:47:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 281 transitions. [2019-01-12 10:47:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 10:47:34,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:34,047 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:34,048 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -703579894, now seen corresponding path program 5 times [2019-01-12 10:47:34,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:34,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:34,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:34,432 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2019-01-12 10:47:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:35,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:35,070 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-01-12 10:47:35,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 10:47:35,109 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 10:47:35,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:35,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:35,237 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:47:35,240 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:35,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:35,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-12 10:47:35,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-12 10:47:35,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:35,330 INFO L478 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 52 treesize of output 54 [2019-01-12 10:47:35,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:35,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-01-12 10:47:35,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,354 INFO L267 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-01-12 10:47:35,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2019-01-12 10:47:35,408 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-12 10:47:35,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:35,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:35,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:35,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:35,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-12 10:47:35,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:35,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2019-01-12 10:47:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:47:35,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:35,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-01-12 10:47:35,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 10:47:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 10:47:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-01-12 10:47:35,487 INFO L87 Difference]: Start difference. First operand 231 states and 281 transitions. Second operand 25 states. [2019-01-12 10:47:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:36,979 INFO L93 Difference]: Finished difference Result 379 states and 455 transitions. [2019-01-12 10:47:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-12 10:47:36,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-01-12 10:47:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:36,984 INFO L225 Difference]: With dead ends: 379 [2019-01-12 10:47:36,984 INFO L226 Difference]: Without dead ends: 330 [2019-01-12 10:47:36,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=493, Invalid=1763, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 10:47:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-12 10:47:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 232. [2019-01-12 10:47:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-12 10:47:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2019-01-12 10:47:37,031 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 35 [2019-01-12 10:47:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:37,031 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2019-01-12 10:47:37,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 10:47:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2019-01-12 10:47:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 10:47:37,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:37,032 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:37,032 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:37,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1456121544, now seen corresponding path program 1 times [2019-01-12 10:47:37,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:37,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:37,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:37,559 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-01-12 10:47:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:38,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:38,141 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-01-12 10:47:38,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:38,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:38,369 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:47:38,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:38,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-12 10:47:38,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-01-12 10:47:38,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,548 INFO L478 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 51 treesize of output 53 [2019-01-12 10:47:38,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,553 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:38,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-12 10:47:38,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-01-12 10:47:38,650 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-12 10:47:38,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-12 10:47:38,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,694 INFO L267 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-01-12 10:47:38,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2019-01-12 10:47:38,761 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-12 10:47:38,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:38,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-12 10:47:38,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:38,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2019-01-12 10:47:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 10:47:38,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:38,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2019-01-12 10:47:38,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 10:47:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 10:47:38,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-01-12 10:47:38,851 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand 28 states. [2019-01-12 10:47:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:40,258 INFO L93 Difference]: Finished difference Result 354 states and 426 transitions. [2019-01-12 10:47:40,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 10:47:40,259 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-01-12 10:47:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:40,261 INFO L225 Difference]: With dead ends: 354 [2019-01-12 10:47:40,261 INFO L226 Difference]: Without dead ends: 304 [2019-01-12 10:47:40,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=293, Invalid=1687, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 10:47:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-12 10:47:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 222. [2019-01-12 10:47:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-12 10:47:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 269 transitions. [2019-01-12 10:47:40,327 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 269 transitions. Word has length 35 [2019-01-12 10:47:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:40,327 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 269 transitions. [2019-01-12 10:47:40,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 10:47:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 269 transitions. [2019-01-12 10:47:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 10:47:40,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:40,333 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:40,333 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash -231391894, now seen corresponding path program 6 times [2019-01-12 10:47:40,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:40,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:40,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:40,962 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-12 10:47:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:41,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:41,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:41,040 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 10:47:41,065 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-01-12 10:47:41,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:41,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:41,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:41,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-01-12 10:47:41,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 10:47:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 10:47:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-01-12 10:47:41,178 INFO L87 Difference]: Start difference. First operand 222 states and 269 transitions. Second operand 15 states. [2019-01-12 10:47:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:41,679 INFO L93 Difference]: Finished difference Result 340 states and 404 transitions. [2019-01-12 10:47:41,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 10:47:41,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-01-12 10:47:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:41,682 INFO L225 Difference]: With dead ends: 340 [2019-01-12 10:47:41,682 INFO L226 Difference]: Without dead ends: 320 [2019-01-12 10:47:41,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-01-12 10:47:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-12 10:47:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 238. [2019-01-12 10:47:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-12 10:47:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 286 transitions. [2019-01-12 10:47:41,741 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 286 transitions. Word has length 37 [2019-01-12 10:47:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:41,741 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 286 transitions. [2019-01-12 10:47:41,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 10:47:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 286 transitions. [2019-01-12 10:47:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 10:47:41,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:41,742 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:41,742 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1650333907, now seen corresponding path program 2 times [2019-01-12 10:47:41,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:41,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:41,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:42,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:42,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:42,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:47:42,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:47:42,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:42,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:42,289 INFO L478 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-01-12 10:47:42,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:42,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 21 treesize of output 33 [2019-01-12 10:47:42,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:42,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:42,313 INFO L267 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-01-12 10:47:42,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2019-01-12 10:47:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:42,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:42,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-01-12 10:47:42,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 10:47:42,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 10:47:42,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2019-01-12 10:47:42,582 INFO L87 Difference]: Start difference. First operand 238 states and 286 transitions. Second operand 26 states. [2019-01-12 10:47:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:43,671 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2019-01-12 10:47:43,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 10:47:43,672 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-01-12 10:47:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:43,674 INFO L225 Difference]: With dead ends: 291 [2019-01-12 10:47:43,674 INFO L226 Difference]: Without dead ends: 278 [2019-01-12 10:47:43,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 10:47:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-12 10:47:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-01-12 10:47:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-12 10:47:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2019-01-12 10:47:43,724 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 38 [2019-01-12 10:47:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:43,724 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2019-01-12 10:47:43,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 10:47:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2019-01-12 10:47:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 10:47:43,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:43,725 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:43,726 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1013617860, now seen corresponding path program 2 times [2019-01-12 10:47:43,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:43,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:43,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:43,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:43,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:45,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:45,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:45,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:47:45,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:47:45,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:45,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:45,555 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:47:45,558 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:45,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:45,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 58 [2019-01-12 10:47:45,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-01-12 10:47:45,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:45,749 INFO L478 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 51 treesize of output 53 [2019-01-12 10:47:45,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:45,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2019-01-12 10:47:45,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-01-12 10:47:45,849 INFO L478 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 0 case distinctions, treesize of input 42 treesize of output 33 [2019-01-12 10:47:45,852 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:45,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:45,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:45,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:45,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:45,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 95 [2019-01-12 10:47:45,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:45,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-12 10:47:46,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,105 INFO L478 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 62 treesize of output 66 [2019-01-12 10:47:46,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,117 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:46,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,120 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:46,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 145 [2019-01-12 10:47:46,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:46,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:46,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 10:47:46,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:56 [2019-01-12 10:47:46,462 INFO L478 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 0 case distinctions, treesize of input 58 treesize of output 47 [2019-01-12 10:47:46,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:46,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 140 [2019-01-12 10:47:46,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-12 10:47:46,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:47:46,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-12 10:47:46,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2019-01-12 10:47:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:46,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:46,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 42 [2019-01-12 10:47:46,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-12 10:47:46,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-12 10:47:46,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 10:47:46,931 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand 42 states. [2019-01-12 10:47:49,141 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-12 10:47:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:49,740 INFO L93 Difference]: Finished difference Result 255 states and 302 transitions. [2019-01-12 10:47:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-12 10:47:49,741 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 38 [2019-01-12 10:47:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:49,743 INFO L225 Difference]: With dead ends: 255 [2019-01-12 10:47:49,744 INFO L226 Difference]: Without dead ends: 246 [2019-01-12 10:47:49,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=449, Invalid=3333, Unknown=0, NotChecked=0, Total=3782 [2019-01-12 10:47:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-12 10:47:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 217. [2019-01-12 10:47:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-12 10:47:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 261 transitions. [2019-01-12 10:47:49,801 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 261 transitions. Word has length 38 [2019-01-12 10:47:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:49,801 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 261 transitions. [2019-01-12 10:47:49,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-12 10:47:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 261 transitions. [2019-01-12 10:47:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 10:47:49,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:49,803 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:49,803 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1518821945, now seen corresponding path program 7 times [2019-01-12 10:47:49,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:49,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:47:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:50,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:50,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:50,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:50,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:50,500 INFO L478 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 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 10:47:50,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2019-01-12 10:47:50,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-01-12 10:47:50,632 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:50,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:50,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:50,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-01-12 10:47:50,744 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:47:50,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:50,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:50,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:50,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:47:50,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:50,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-01-12 10:47:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:51,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:51,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-01-12 10:47:51,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-12 10:47:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-12 10:47:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 10:47:51,031 INFO L87 Difference]: Start difference. First operand 217 states and 261 transitions. Second operand 34 states. [2019-01-12 10:47:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:52,115 INFO L93 Difference]: Finished difference Result 291 states and 344 transitions. [2019-01-12 10:47:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 10:47:52,117 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 39 [2019-01-12 10:47:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:52,119 INFO L225 Difference]: With dead ends: 291 [2019-01-12 10:47:52,119 INFO L226 Difference]: Without dead ends: 289 [2019-01-12 10:47:52,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=377, Invalid=2275, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 10:47:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-12 10:47:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 237. [2019-01-12 10:47:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-12 10:47:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2019-01-12 10:47:52,183 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 39 [2019-01-12 10:47:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:52,184 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2019-01-12 10:47:52,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-12 10:47:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2019-01-12 10:47:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 10:47:52,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:52,185 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:52,185 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:52,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1558500832, now seen corresponding path program 1 times [2019-01-12 10:47:52,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:52,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:52,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:52,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:52,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:52,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:52,799 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:47:52,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:52,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 47 [2019-01-12 10:47:52,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:52,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:52,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:52,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-01-12 10:47:53,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:53,004 INFO L478 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 50 treesize of output 52 [2019-01-12 10:47:53,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:53,008 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:53,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-12 10:47:53,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:53,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:53,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:47:53,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:32 [2019-01-12 10:47:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:53,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:53,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-01-12 10:47:53,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-12 10:47:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-12 10:47:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 10:47:53,251 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand 33 states. [2019-01-12 10:47:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:55,254 INFO L93 Difference]: Finished difference Result 368 states and 437 transitions. [2019-01-12 10:47:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-12 10:47:55,255 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-01-12 10:47:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:55,257 INFO L225 Difference]: With dead ends: 368 [2019-01-12 10:47:55,258 INFO L226 Difference]: Without dead ends: 303 [2019-01-12 10:47:55,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=471, Invalid=3819, Unknown=0, NotChecked=0, Total=4290 [2019-01-12 10:47:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-12 10:47:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 241. [2019-01-12 10:47:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-12 10:47:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 287 transitions. [2019-01-12 10:47:55,342 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 287 transitions. Word has length 39 [2019-01-12 10:47:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:55,343 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 287 transitions. [2019-01-12 10:47:55,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-12 10:47:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 287 transitions. [2019-01-12 10:47:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 10:47:55,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:55,349 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:55,349 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2060667424, now seen corresponding path program 3 times [2019-01-12 10:47:55,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:47:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:47:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:47:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:56,467 WARN L181 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-01-12 10:47:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:57,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:47:57,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:47:57,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:47:57,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 10:47:57,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:57,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:57,863 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:47:57,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:57,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:47:57,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:57,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:57,886 INFO L267 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-01-12 10:47:57,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-01-12 10:47:57,942 INFO L478 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 0 case distinctions, treesize of input 42 treesize of output 33 [2019-01-12 10:47:57,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:57,946 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:57,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:57,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:57,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 81 [2019-01-12 10:47:57,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:57,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:57,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:57,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:46 [2019-01-12 10:47:58,099 INFO L478 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 0 case distinctions, treesize of input 61 treesize of output 48 [2019-01-12 10:47:58,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 120 [2019-01-12 10:47:58,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-12 10:47:58,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:47:58,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:47:58,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:131 [2019-01-12 10:47:58,602 INFO L478 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 0 case distinctions, treesize of input 53 treesize of output 42 [2019-01-12 10:47:58,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,610 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:58,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 93 [2019-01-12 10:47:58,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:58,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:58,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:58,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2019-01-12 10:47:58,722 INFO L478 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 0 case distinctions, treesize of input 36 treesize of output 29 [2019-01-12 10:47:58,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:58,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2019-01-12 10:47:58,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:58,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:58,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:58,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2019-01-12 10:47:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:58,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:58,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2019-01-12 10:47:58,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 10:47:58,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 10:47:58,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 10:47:58,869 INFO L87 Difference]: Start difference. First operand 241 states and 287 transitions. Second operand 36 states. [2019-01-12 10:48:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:01,075 INFO L93 Difference]: Finished difference Result 312 states and 366 transitions. [2019-01-12 10:48:01,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 10:48:01,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-01-12 10:48:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:01,079 INFO L225 Difference]: With dead ends: 312 [2019-01-12 10:48:01,079 INFO L226 Difference]: Without dead ends: 303 [2019-01-12 10:48:01,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=408, Invalid=2898, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 10:48:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-12 10:48:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 251. [2019-01-12 10:48:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-12 10:48:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2019-01-12 10:48:01,150 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 39 [2019-01-12 10:48:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:01,150 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2019-01-12 10:48:01,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 10:48:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2019-01-12 10:48:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 10:48:01,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:01,151 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:01,151 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:01,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1077848874, now seen corresponding path program 3 times [2019-01-12 10:48:01,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:01,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:01,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:01,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:01,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:01,587 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2019-01-12 10:48:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:02,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:02,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:48:02,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 10:48:02,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:02,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:02,468 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:48:02,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:02,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:48:02,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-01-12 10:48:02,593 INFO L478 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 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-12 10:48:02,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:02,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:02,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:02,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2019-01-12 10:48:02,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2019-01-12 10:48:02,737 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-12 10:48:02,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:02,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:02,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:02,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2019-01-12 10:48:02,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:02,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-01-12 10:48:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:02,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:02,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2019-01-12 10:48:02,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 10:48:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 10:48:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 10:48:02,949 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand 36 states. [2019-01-12 10:48:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:05,194 INFO L93 Difference]: Finished difference Result 504 states and 603 transitions. [2019-01-12 10:48:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-12 10:48:05,195 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-01-12 10:48:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:05,198 INFO L225 Difference]: With dead ends: 504 [2019-01-12 10:48:05,199 INFO L226 Difference]: Without dead ends: 454 [2019-01-12 10:48:05,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=723, Invalid=4827, Unknown=0, NotChecked=0, Total=5550 [2019-01-12 10:48:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-01-12 10:48:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 314. [2019-01-12 10:48:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-12 10:48:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 376 transitions. [2019-01-12 10:48:05,298 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 376 transitions. Word has length 40 [2019-01-12 10:48:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:05,298 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 376 transitions. [2019-01-12 10:48:05,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 10:48:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 376 transitions. [2019-01-12 10:48:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 10:48:05,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:05,300 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:05,303 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1570917360, now seen corresponding path program 4 times [2019-01-12 10:48:05,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:05,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:05,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:06,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:06,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:48:06,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:48:06,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:06,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:06,276 INFO L478 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 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-12 10:48:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:06,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2019-01-12 10:48:06,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:06,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:06,303 INFO L267 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-01-12 10:48:06,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-01-12 10:48:06,414 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-12 10:48:06,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:06,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:06,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:06,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2019-01-12 10:48:06,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:06,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:06,448 INFO L267 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-01-12 10:48:06,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-01-12 10:48:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:06,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:06,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-01-12 10:48:06,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-12 10:48:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-12 10:48:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 10:48:06,669 INFO L87 Difference]: Start difference. First operand 314 states and 376 transitions. Second operand 33 states. [2019-01-12 10:48:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:09,932 INFO L93 Difference]: Finished difference Result 568 states and 686 transitions. [2019-01-12 10:48:09,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-12 10:48:09,934 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-01-12 10:48:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:09,937 INFO L225 Difference]: With dead ends: 568 [2019-01-12 10:48:09,937 INFO L226 Difference]: Without dead ends: 506 [2019-01-12 10:48:09,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=729, Invalid=4673, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 10:48:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-01-12 10:48:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 372. [2019-01-12 10:48:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-12 10:48:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2019-01-12 10:48:10,074 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 40 [2019-01-12 10:48:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:10,074 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2019-01-12 10:48:10,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-12 10:48:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2019-01-12 10:48:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 10:48:10,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:10,076 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:10,076 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1841450632, now seen corresponding path program 3 times [2019-01-12 10:48:10,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:10,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:10,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:10,743 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-12 10:48:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:11,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:11,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:48:11,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 10:48:11,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:11,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:11,545 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 31 [2019-01-12 10:48:11,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:11,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 47 [2019-01-12 10:48:11,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-01-12 10:48:11,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:11,763 INFO L478 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 51 treesize of output 53 [2019-01-12 10:48:11,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:11,767 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:48:11,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2019-01-12 10:48:11,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-01-12 10:48:11,898 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-12 10:48:11,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:11,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:11,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:11,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-12 10:48:11,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:11,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2019-01-12 10:48:12,094 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-01-12 10:48:12,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:12,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2019-01-12 10:48:12,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:12,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:12,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:12,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2019-01-12 10:48:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:12,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2019-01-12 10:48:12,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-12 10:48:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-12 10:48:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 10:48:12,458 INFO L87 Difference]: Start difference. First operand 372 states and 450 transitions. Second operand 41 states. [2019-01-12 10:48:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:14,106 INFO L93 Difference]: Finished difference Result 457 states and 547 transitions. [2019-01-12 10:48:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 10:48:14,107 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-01-12 10:48:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:14,109 INFO L225 Difference]: With dead ends: 457 [2019-01-12 10:48:14,109 INFO L226 Difference]: Without dead ends: 455 [2019-01-12 10:48:14,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=510, Invalid=3650, Unknown=0, NotChecked=0, Total=4160 [2019-01-12 10:48:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-01-12 10:48:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 372. [2019-01-12 10:48:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-12 10:48:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2019-01-12 10:48:14,208 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 40 [2019-01-12 10:48:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:14,208 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2019-01-12 10:48:14,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-12 10:48:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2019-01-12 10:48:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 10:48:14,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:14,210 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:14,210 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:14,210 INFO L82 PathProgramCache]: Analyzing trace with hash -506394531, now seen corresponding path program 8 times [2019-01-12 10:48:14,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:14,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:14,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:14,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:14,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:14,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:14,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:14,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:48:14,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:48:14,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:14,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:15,038 INFO L478 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 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 10:48:15,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2019-01-12 10:48:15,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:15,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:15,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:15,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-01-12 10:48:15,158 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-12 10:48:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:48:15,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 27 [2019-01-12 10:48:15,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:48:15,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:15,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:48:15,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-12 10:48:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:15,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-01-12 10:48:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-12 10:48:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-12 10:48:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 10:48:15,442 INFO L87 Difference]: Start difference. First operand 372 states and 450 transitions. Second operand 33 states. [2019-01-12 10:48:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:16,852 INFO L93 Difference]: Finished difference Result 576 states and 688 transitions. [2019-01-12 10:48:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 10:48:16,854 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-01-12 10:48:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:16,857 INFO L225 Difference]: With dead ends: 576 [2019-01-12 10:48:16,857 INFO L226 Difference]: Without dead ends: 574 [2019-01-12 10:48:16,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=315, Invalid=2337, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 10:48:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-01-12 10:48:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 429. [2019-01-12 10:48:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-01-12 10:48:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 520 transitions. [2019-01-12 10:48:16,992 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 520 transitions. Word has length 43 [2019-01-12 10:48:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:16,993 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 520 transitions. [2019-01-12 10:48:16,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-12 10:48:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 520 transitions. [2019-01-12 10:48:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 10:48:16,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:16,996 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:16,996 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 432114678, now seen corresponding path program 2 times [2019-01-12 10:48:16,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:16,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:17,089 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 10:48:17,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:48:17 BoogieIcfgContainer [2019-01-12 10:48:17,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:48:17,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:48:17,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:48:17,177 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:48:17,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:46:38" (3/4) ... [2019-01-12 10:48:17,184 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 10:48:17,261 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:48:17,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:48:17,262 INFO L168 Benchmark]: Toolchain (without parser) took 99767.04 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.2 MB). Free memory was 951.4 MB in the beginning and 963.0 MB in the end (delta: -11.7 MB). Peak memory consumption was 423.5 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:17,263 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:17,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:17,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:17,263 INFO L168 Benchmark]: Boogie Preprocessor took 33.28 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:17,269 INFO L168 Benchmark]: RCFGBuilder took 530.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:17,269 INFO L168 Benchmark]: TraceAbstraction took 98740.08 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 963.0 MB in the end (delta: 118.9 MB). Peak memory consumption was 446.6 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:17,270 INFO L168 Benchmark]: Witness Printer took 84.89 ms. Allocated memory is still 1.5 GB. Free memory is still 963.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:17,275 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.28 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 530.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98740.08 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 963.0 MB in the end (delta: 118.9 MB). Peak memory consumption was 446.6 MB. Max. memory is 11.5 GB. * Witness Printer took 84.89 ms. Allocated memory is still 1.5 GB. Free memory is still 963.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND FALSE !(j