./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_i15_o15_true-unreach-call_true-termination.c --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/recursive-simple/id_i15_o15_true-unreach-call_true-termination.c -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 946ca263ceeb3f3c46f4e6e15a44f3d7052d43ca .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:12:07,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:12:07,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:12:07,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:12:07,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:12:07,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:12:07,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:12:07,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:12:07,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:12:07,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:12:07,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:12:07,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:12:07,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:12:07,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:12:07,792 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:12:07,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:12:07,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:12:07,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:12:07,803 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:12:07,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:12:07,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:12:07,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:12:07,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:12:07,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:12:07,819 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:12:07,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:12:07,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:12:07,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:12:07,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:12:07,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:12:07,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:12:07,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:12:07,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:12:07,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:12:07,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:12:07,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:12:07,837 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:12:07,851 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:12:07,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:12:07,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:12:07,853 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:12:07,853 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:12:07,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:12:07,854 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:12:07,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:12:07,854 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:12:07,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:12:07,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:12:07,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:12:07,855 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:12:07,855 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:12:07,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:12:07,855 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:12:07,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:12:07,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:12:07,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:12:07,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:12:07,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:12:07,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:12:07,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:12:07,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:12:07,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:12:07,857 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:12:07,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:12:07,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:12:07,858 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 -> 946ca263ceeb3f3c46f4e6e15a44f3d7052d43ca [2019-01-12 15:12:07,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:12:07,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:12:07,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:12:07,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:12:07,950 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:12:07,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_i15_o15_true-unreach-call_true-termination.c [2019-01-12 15:12:08,013 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e74e871/f7d1f915bcbd43fe97ae9aa341abf884/FLAG576fdb52f [2019-01-12 15:12:08,435 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:12:08,436 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_i15_o15_true-unreach-call_true-termination.c [2019-01-12 15:12:08,442 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e74e871/f7d1f915bcbd43fe97ae9aa341abf884/FLAG576fdb52f [2019-01-12 15:12:08,786 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e74e871/f7d1f915bcbd43fe97ae9aa341abf884 [2019-01-12 15:12:08,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:12:08,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:12:08,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:08,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:12:08,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:12:08,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:08" (1/1) ... [2019-01-12 15:12:08,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216b07dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:08, skipping insertion in model container [2019-01-12 15:12:08,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:08" (1/1) ... [2019-01-12 15:12:08,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:12:08,833 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:12:09,017 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:09,022 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:12:09,039 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:09,056 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:12:09,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09 WrapperNode [2019-01-12 15:12:09,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:09,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:09,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:12:09,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:12:09,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:09,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:12:09,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:12:09,102 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:12:09,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:12:09,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:12:09,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:12:09,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:12:09,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (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 15:12:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:12:09,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:12:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 15:12:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 15:12:09,538 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:12:09,538 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:12:09,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:09 BoogieIcfgContainer [2019-01-12 15:12:09,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:12:09,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:12:09,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:12:09,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:12:09,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:12:08" (1/3) ... [2019-01-12 15:12:09,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63161c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:09, skipping insertion in model container [2019-01-12 15:12:09,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (2/3) ... [2019-01-12 15:12:09,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63161c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:09, skipping insertion in model container [2019-01-12 15:12:09,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:09" (3/3) ... [2019-01-12 15:12:09,548 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i15_o15_true-unreach-call_true-termination.c [2019-01-12 15:12:09,559 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:12:09,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:12:09,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:12:09,608 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:12:09,609 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:12:09,609 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:12:09,609 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:12:09,610 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:12:09,610 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:12:09,610 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:12:09,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:12:09,610 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:12:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:12:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:12:09,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:09,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:09,640 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:12:09,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:09,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:09,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:09,967 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 15:12:09,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:09,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:12:09,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:12:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:12:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:12:09,991 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:12:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:10,145 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 15:12:10,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:12:10,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:12:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:10,156 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:10,157 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:12:10,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:12:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:12:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:12:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:12:10,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:12:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:10,205 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:12:10,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:12:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:12:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:12:10,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:10,207 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:10,207 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:12:10,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:10,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:10,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:10,337 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 15:12:10,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:10,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:10,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:10,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:12:10,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:12:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:12:10,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:10,477 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 15:12:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:10,697 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:12:10,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:12:10,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 15:12:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:10,701 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:12:10,702 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:12:10,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:12:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:12:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:12:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:12:10,716 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:12:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:10,716 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:12:10,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:12:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:12:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:12:10,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:10,721 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:10,722 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:10,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:10,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:12:10,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:10,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:10,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:10,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:10,964 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 15:12:10,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:11,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:11,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:11,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:11,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:11,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:12:11,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:12:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:12:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:12:11,079 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 15:12:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:11,218 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:12:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:12:11,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 15:12:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:11,221 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:11,221 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:12:11,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:12:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:12:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:12:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:12:11,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:12:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:11,232 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:12:11,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:12:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:12:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:12:11,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:11,233 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:11,234 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:12:11,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:11,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:11,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:11,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:11,445 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 15:12:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:11,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:12:11,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:11,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:11,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:11,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:12:11,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:12:11,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:12:11,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:11,529 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 15:12:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:11,657 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:12:11,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:12:11,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 15:12:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:11,661 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:12:11,661 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:12:11,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:12:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:12:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:12:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:12:11,668 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:12:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:11,669 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:12:11,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:12:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:12:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:12:11,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:11,670 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:11,671 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:12:11,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:11,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:12,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:12,156 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 15:12:12,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:12,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:12,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:12,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:12,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:12:12,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:12:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:12:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:12:12,245 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 15:12:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:12,400 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:12:12,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:12:12,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 15:12:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:12,403 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:12:12,403 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:12:12,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:12:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:12:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:12:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:12:12,412 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:12:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:12,412 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:12:12,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:12:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:12:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:12:12,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:12,415 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:12,415 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:12:12,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:12,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:12,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:12,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:12,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:12,591 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 15:12:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:12,653 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:12:12,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:12,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:12,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:12,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:12:12,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:12:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:12:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:12,727 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2019-01-12 15:12:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:12,916 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:12:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:12:12,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-12 15:12:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:12,919 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:12:12,919 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:12:12,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:12:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:12:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:12:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:12:12,927 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:12:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:12,927 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:12:12,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:12:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:12:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:12:12,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:12,929 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:12,930 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:12:12,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:12,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:12,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:13,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:13,158 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 15:12:13,169 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:13,196 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:12:13,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:13,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:13,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:13,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:12:13,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:12:13,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:12:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:12:13,270 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2019-01-12 15:12:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:13,570 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:12:13,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:12:13,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-12 15:12:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:13,572 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:12:13,572 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:12:13,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:12:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:12:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:12:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:12:13,580 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:12:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:13,581 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:12:13,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:12:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:12:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:12:13,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:13,583 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:13,583 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:12:13,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:13,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:13,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:13,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:13,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:13,894 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 15:12:13,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:13,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:13,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:13,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 15:12:13,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:12:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:12:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:13,995 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-01-12 15:12:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:14,308 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:12:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:12:14,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-01-12 15:12:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:14,312 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:12:14,312 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:12:14,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:12:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:12:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:12:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:12:14,324 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:12:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:14,325 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:12:14,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:12:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:12:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:12:14,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:14,328 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:14,329 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:14,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:12:14,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:14,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:14,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:14,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:14,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:14,559 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 15:12:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:14,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:14,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:14,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:14,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:14,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 15:12:14,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:12:14,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:12:14,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:12:14,674 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 15:12:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:14,969 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:12:14,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:12:14,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 15:12:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:14,973 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:12:14,973 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:12:14,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:12:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:12:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:12:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:12:14,982 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:12:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:14,982 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:12:14,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:12:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:12:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:12:14,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:14,986 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:14,987 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:12:14,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:15,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:15,212 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 15:12:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:15,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:12:15,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:15,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:15,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:15,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 15:12:15,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:12:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:12:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:15,471 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-01-12 15:12:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:15,872 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:12:15,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:12:15,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-01-12 15:12:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:15,876 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:12:15,877 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:12:15,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:12:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:12:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:12:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:12:15,886 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:12:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:15,887 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:12:15,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:12:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:12:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:12:15,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:15,890 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:15,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:12:15,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:15,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:16,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:16,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 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 15:12:16,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:16,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:16,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:16,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:16,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:16,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 15:12:16,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:12:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:12:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:12:16,371 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 15:12:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:16,762 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 15:12:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:12:16,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 15:12:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:16,766 INFO L225 Difference]: With dead ends: 48 [2019-01-12 15:12:16,766 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:12:16,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:12:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:12:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:12:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 15:12:16,778 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 15:12:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:16,778 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 15:12:16,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:12:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 15:12:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:12:16,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:16,781 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:16,782 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 15:12:16,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:16,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:16,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:17,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:17,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:12:17,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:17,067 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 15:12:17,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:17,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:17,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:17,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 15:12:17,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:12:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:12:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:17,148 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 15:12:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:17,686 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 15:12:17,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:12:17,689 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 15:12:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:17,690 INFO L225 Difference]: With dead ends: 51 [2019-01-12 15:12:17,691 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 15:12:17,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:12:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 15:12:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 15:12:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 15:12:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 15:12:17,701 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 15:12:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:17,702 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 15:12:17,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:12:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 15:12:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 15:12:17,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:17,705 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:17,706 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 15:12:17,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:17,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:18,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:18,032 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 15:12:18,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:18,146 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 15:12:18,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:18,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:18,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:18,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 15:12:18,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:12:18,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:12:18,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:12:18,230 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 17 states. [2019-01-12 15:12:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:18,654 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 15:12:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:12:18,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-01-12 15:12:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:18,658 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:12:18,658 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:12:18,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:12:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:12:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 15:12:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:12:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 15:12:18,669 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 15:12:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:18,669 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 15:12:18,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:12:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 15:12:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:12:18,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:18,674 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:18,674 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 15:12:18,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:18,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:19,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:19,005 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 15:12:19,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:19,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:19,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:19,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 15:12:19,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:12:19,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:12:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:19,162 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-01-12 15:12:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:19,506 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 15:12:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:12:19,507 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-01-12 15:12:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:19,510 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:12:19,510 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:12:19,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:12:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:12:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:12:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:12:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 15:12:19,519 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 15:12:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:19,520 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 15:12:19,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:12:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 15:12:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:12:19,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:19,524 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:19,524 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 15:12:19,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:19,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:19,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:19,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:19,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:19,799 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 15:12:19,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:19,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:19,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:19,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:19,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:19,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 15:12:19,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 15:12:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 15:12:19,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:12:19,919 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 19 states. [2019-01-12 15:12:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:20,274 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 15:12:20,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:12:20,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-01-12 15:12:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:20,277 INFO L225 Difference]: With dead ends: 60 [2019-01-12 15:12:20,277 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:12:20,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:12:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:12:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 15:12:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 15:12:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 15:12:20,286 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 15:12:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:20,286 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 15:12:20,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 15:12:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 15:12:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:12:20,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:20,290 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:20,290 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:20,291 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 15:12:20,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:20,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:21,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:21,139 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 15:12:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:21,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 15:12:21,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:21,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:21,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:21,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-01-12 15:12:21,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 15:12:21,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 15:12:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 15:12:21,300 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 35 states. [2019-01-12 15:12:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:22,040 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 15:12:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 15:12:22,041 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2019-01-12 15:12:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:22,043 INFO L225 Difference]: With dead ends: 63 [2019-01-12 15:12:22,043 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 15:12:22,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 15:12:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 15:12:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 15:12:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 15:12:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 15:12:22,053 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 15:12:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:22,053 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 15:12:22,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 15:12:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 15:12:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:12:22,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:22,056 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:22,058 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 15:12:22,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:22,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:22,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:22,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:22,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:12:22,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:22,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-12 15:12:22,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:12:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:12:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:12:22,658 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 21 states. [2019-01-12 15:12:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:22,948 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-12 15:12:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 15:12:22,950 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-01-12 15:12:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:22,951 INFO L225 Difference]: With dead ends: 59 [2019-01-12 15:12:22,951 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:12:22,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:12:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:12:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:12:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:12:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:12:22,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2019-01-12 15:12:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:22,955 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:12:22,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:12:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:12:22,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:12:22,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:12:22,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:12:22,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:12:22,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-01-12 15:12:22,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:12:22,989 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-01-12 15:12:22,989 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2019-01-12 15:12:22,989 INFO L444 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: (and (<= ULTIMATE.start_main_~input~0 15) (<= 15 ULTIMATE.start_main_~input~0)) [2019-01-12 15:12:22,989 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-01-12 15:12:22,989 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 15) no Hoare annotation was computed. [2019-01-12 15:12:22,989 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2019-01-12 15:12:22,989 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2019-01-12 15:12:22,989 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2019-01-12 15:12:22,990 INFO L444 ceAbstractionStarter]: At program point L6(line 6) the Hoare annotation is: (and (<= |id_#in~x| id_~x) (<= id_~x |id_#in~x|)) [2019-01-12 15:12:22,990 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 15:12:22,990 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-01-12 15:12:22,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:12:22 BoogieIcfgContainer [2019-01-12 15:12:22,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:12:22,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:12:22,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:12:22,994 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:12:22,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:09" (3/4) ... [2019-01-12 15:12:22,997 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:12:23,004 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-01-12 15:12:23,009 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:12:23,009 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:12:23,053 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:12:23,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:12:23,054 INFO L168 Benchmark]: Toolchain (without parser) took 14262.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -310.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:23,057 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:23,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.10 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.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 15:12:23,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.76 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:23,059 INFO L168 Benchmark]: Boogie Preprocessor took 20.64 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:23,060 INFO L168 Benchmark]: RCFGBuilder took 417.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:23,061 INFO L168 Benchmark]: TraceAbstraction took 13452.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -141.4 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:23,062 INFO L168 Benchmark]: Witness Printer took 59.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:23,067 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.10 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.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 42.76 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.64 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 417.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13452.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -141.4 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. SAFE Result, 13.3s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 216 SDtfs, 323 SDslu, 1908 SDs, 0 SdLazy, 1613 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1334 GetRequests, 994 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1824 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 350752 SizeOfPredicates, 134 NumberOfNonLiveVariables, 2025 ConjunctsInSsa, 333 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 4624/8464 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...