./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a9963030a13e3c679db84f21688cc66372a5ac3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:24:32,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:24:32,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:24:32,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:24:32,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:24:32,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:24:32,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:24:32,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:24:32,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:24:32,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:24:32,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:24:32,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:24:32,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:24:32,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:24:32,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:24:32,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:24:32,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:24:32,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:24:32,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:24:32,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:24:32,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:24:32,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:24:32,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:24:32,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:24:32,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:24:32,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:24:32,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:24:32,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:24:32,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:24:32,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:24:32,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:24:32,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:24:32,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:24:32,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:24:32,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:24:32,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:24:32,946 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:24:32,961 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:24:32,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:24:32,963 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:24:32,963 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:24:32,963 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:24:32,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:24:32,963 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:24:32,964 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:24:32,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:24:32,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:24:32,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:24:32,965 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:24:32,965 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:24:32,965 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:24:32,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:24:32,966 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:24:32,966 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:24:32,966 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:24:32,966 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:24:32,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:24:32,968 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:24:32,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:24:32,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:24:32,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:24:32,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:24:32,969 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:24:32,969 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:24:32,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:24:32,970 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 -> 1a9963030a13e3c679db84f21688cc66372a5ac3 [2019-01-12 11:24:33,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:24:33,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:24:33,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:24:33,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:24:33,036 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:24:33,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2019-01-12 11:24:33,108 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d73c353c/27e9290c2f1541999b17c0537d4495c8/FLAGf9f3f038d [2019-01-12 11:24:33,487 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:24:33,487 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2019-01-12 11:24:33,492 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d73c353c/27e9290c2f1541999b17c0537d4495c8/FLAGf9f3f038d [2019-01-12 11:24:33,883 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d73c353c/27e9290c2f1541999b17c0537d4495c8 [2019-01-12 11:24:33,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:24:33,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:24:33,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:24:33,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:24:33,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:24:33,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:24:33" (1/1) ... [2019-01-12 11:24:33,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396e2ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:33, skipping insertion in model container [2019-01-12 11:24:33,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:24:33" (1/1) ... [2019-01-12 11:24:33,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:24:33,922 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:24:34,116 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:24:34,120 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:24:34,136 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:24:34,151 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:24:34,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34 WrapperNode [2019-01-12 11:24:34,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:24:34,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:24:34,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:24:34,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:24:34,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:24:34,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:24:34,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:24:34,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:24:34,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (1/1) ... [2019-01-12 11:24:34,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:24:34,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:24:34,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:24:34,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:24:34,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (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 11:24:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:24:34,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:24:34,602 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:24:34,603 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 11:24:34,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:24:34 BoogieIcfgContainer [2019-01-12 11:24:34,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:24:34,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:24:34,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:24:34,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:24:34,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:24:33" (1/3) ... [2019-01-12 11:24:34,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ee426f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:24:34, skipping insertion in model container [2019-01-12 11:24:34,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:34" (2/3) ... [2019-01-12 11:24:34,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ee426f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:24:34, skipping insertion in model container [2019-01-12 11:24:34,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:24:34" (3/3) ... [2019-01-12 11:24:34,613 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call_true-termination.c.i [2019-01-12 11:24:34,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:24:34,628 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:24:34,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:24:34,669 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:24:34,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:24:34,670 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:24:34,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:24:34,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:24:34,671 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:24:34,671 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:24:34,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:24:34,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:24:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-12 11:24:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 11:24:34,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:34,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 11:24:34,695 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash 30108868, now seen corresponding path program 1 times [2019-01-12 11:24:34,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:34,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:34,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:34,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:34,800 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 11:24:34,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:24:34,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 11:24:34,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 11:24:34,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 11:24:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 11:24:34,826 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2019-01-12 11:24:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:34,842 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-12 11:24:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 11:24:34,843 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-01-12 11:24:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:34,851 INFO L225 Difference]: With dead ends: 19 [2019-01-12 11:24:34,852 INFO L226 Difference]: Without dead ends: 7 [2019-01-12 11:24:34,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 11:24:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-12 11:24:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-12 11:24:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-12 11:24:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-12 11:24:34,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-12 11:24:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:34,887 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-12 11:24:34,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 11:24:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-12 11:24:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 11:24:34,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:34,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 11:24:34,888 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash 29810958, now seen corresponding path program 1 times [2019-01-12 11:24:34,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:34,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:34,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:34,934 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 11:24:34,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:24:34,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 11:24:34,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:24:34,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:24:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:24:34,937 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2019-01-12 11:24:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:35,042 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-01-12 11:24:35,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:24:35,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-12 11:24:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:35,044 INFO L225 Difference]: With dead ends: 15 [2019-01-12 11:24:35,044 INFO L226 Difference]: Without dead ends: 9 [2019-01-12 11:24:35,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:24:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-12 11:24:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-12 11:24:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-12 11:24:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-12 11:24:35,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-01-12 11:24:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:35,049 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-12 11:24:35,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:24:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-12 11:24:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:24:35,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:35,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:24:35,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1366097711, now seen corresponding path program 1 times [2019-01-12 11:24:35,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:35,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:35,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:35,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:35,167 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 11:24:35,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:35,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:35,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 11:24:35,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-01-12 11:24:35,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:24:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:24:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:24:35,263 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-12 11:24:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:35,330 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-01-12 11:24:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:24:35,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-12 11:24:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:35,332 INFO L225 Difference]: With dead ends: 19 [2019-01-12 11:24:35,332 INFO L226 Difference]: Without dead ends: 13 [2019-01-12 11:24:35,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:24:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-12 11:24:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-12 11:24:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 11:24:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-12 11:24:35,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2019-01-12 11:24:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:35,338 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-12 11:24:35,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:24:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-12 11:24:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:24:35,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:35,339 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 11:24:35,339 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:35,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2136142105, now seen corresponding path program 1 times [2019-01-12 11:24:35,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:35,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:35,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:35,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:35,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:35,429 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 11:24:35,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:35,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:35,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:35,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-12 11:24:35,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:24:35,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:24:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:24:35,492 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 5 states. [2019-01-12 11:24:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:35,575 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-01-12 11:24:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:24:35,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-12 11:24:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:35,577 INFO L225 Difference]: With dead ends: 21 [2019-01-12 11:24:35,577 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 11:24:35,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:24:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 11:24:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 11:24:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 11:24:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 11:24:35,581 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-01-12 11:24:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:35,582 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 11:24:35,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:24:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 11:24:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:24:35,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:35,583 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 11:24:35,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:35,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1884622180, now seen corresponding path program 2 times [2019-01-12 11:24:35,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:35,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:35,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:35,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:35,695 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 11:24:35,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:35,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:35,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:35,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:35,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:35,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-12 11:24:35,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:24:35,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:24:35,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:24:35,810 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 11:24:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:35,967 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-12 11:24:35,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:24:35,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:24:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:35,972 INFO L225 Difference]: With dead ends: 23 [2019-01-12 11:24:35,972 INFO L226 Difference]: Without dead ends: 16 [2019-01-12 11:24:35,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:24:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-12 11:24:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-12 11:24:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 11:24:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-12 11:24:35,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-01-12 11:24:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:35,979 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-12 11:24:35,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:24:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-12 11:24:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:24:35,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:35,980 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 11:24:35,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:35,982 INFO L82 PathProgramCache]: Analyzing trace with hash -368533665, now seen corresponding path program 3 times [2019-01-12 11:24:35,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:35,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:35,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:36,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:36,091 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 11:24:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:36,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 11:24:36,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:36,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:24:36,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:36,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-12 11:24:36,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:24:36,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:24:36,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:24:36,197 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-12 11:24:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:36,350 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2019-01-12 11:24:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 11:24:36,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-12 11:24:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:36,354 INFO L225 Difference]: With dead ends: 28 [2019-01-12 11:24:36,354 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 11:24:36,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:24:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 11:24:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-12 11:24:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 11:24:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-12 11:24:36,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-01-12 11:24:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:36,361 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-12 11:24:36,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:24:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-01-12 11:24:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 11:24:36,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:36,362 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1] [2019-01-12 11:24:36,362 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash -203542233, now seen corresponding path program 4 times [2019-01-12 11:24:36,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:36,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:36,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:36,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:36,531 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 11:24:36,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:36,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:36,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:36,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:36,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:36,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 11:24:36,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:24:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:24:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:24:36,584 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 8 states. [2019-01-12 11:24:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:36,645 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-01-12 11:24:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:24:36,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-12 11:24:36,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:36,647 INFO L225 Difference]: With dead ends: 31 [2019-01-12 11:24:36,647 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 11:24:36,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:24:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 11:24:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 11:24:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 11:24:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-12 11:24:36,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-01-12 11:24:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:36,653 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-12 11:24:36,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:24:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-12 11:24:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 11:24:36,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:36,654 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1] [2019-01-12 11:24:36,654 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1336541098, now seen corresponding path program 5 times [2019-01-12 11:24:36,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:36,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:37,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:37,107 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 11:24:37,117 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:24:37,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-01-12 11:24:37,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:37,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:37,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:37,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 11:24:37,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:24:37,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:24:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:24:37,166 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 9 states. [2019-01-12 11:24:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:37,220 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-01-12 11:24:37,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 11:24:37,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-12 11:24:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:37,221 INFO L225 Difference]: With dead ends: 33 [2019-01-12 11:24:37,221 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 11:24:37,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:24:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 11:24:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 11:24:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 11:24:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-12 11:24:37,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-01-12 11:24:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:37,227 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-12 11:24:37,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:24:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-12 11:24:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:24:37,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:37,228 INFO L402 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1] [2019-01-12 11:24:37,228 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash -407094931, now seen corresponding path program 6 times [2019-01-12 11:24:37,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:37,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:37,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:37,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:37,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:37,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:37,359 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 11:24:37,378 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:24:37,414 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-01-12 11:24:37,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:37,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:37,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2019-01-12 11:24:37,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 11:24:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 11:24:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:24:37,709 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 19 states. [2019-01-12 11:24:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:38,038 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2019-01-12 11:24:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 11:24:38,040 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-01-12 11:24:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:38,041 INFO L225 Difference]: With dead ends: 50 [2019-01-12 11:24:38,041 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 11:24:38,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:24:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 11:24:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-12 11:24:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 11:24:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-01-12 11:24:38,050 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 23 [2019-01-12 11:24:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:38,051 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-01-12 11:24:38,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 11:24:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2019-01-12 11:24:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 11:24:38,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:38,053 INFO L402 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1, 1, 1] [2019-01-12 11:24:38,053 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1974653933, now seen corresponding path program 7 times [2019-01-12 11:24:38,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:38,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:38,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:38,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:24:38,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:38,401 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 11:24:38,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:38,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:24:38,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:38,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 11:24:38,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 11:24:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 11:24:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:24:38,479 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 11 states. [2019-01-12 11:24:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:38,865 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2019-01-12 11:24:38,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 11:24:38,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-12 11:24:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:38,868 INFO L225 Difference]: With dead ends: 65 [2019-01-12 11:24:38,868 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 11:24:38,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:24:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 11:24:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-12 11:24:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 11:24:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-01-12 11:24:38,884 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 39 [2019-01-12 11:24:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:38,884 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-01-12 11:24:38,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 11:24:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-01-12 11:24:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 11:24:38,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:38,890 INFO L402 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1, 1, 1] [2019-01-12 11:24:38,890 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:38,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1704223978, now seen corresponding path program 8 times [2019-01-12 11:24:38,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:38,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:38,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:24:39,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:39,059 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 11:24:39,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:39,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:39,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:39,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:24:39,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 11:24:39,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 11:24:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 11:24:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:24:39,145 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 12 states. [2019-01-12 11:24:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:39,238 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-01-12 11:24:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 11:24:39,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-12 11:24:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:39,241 INFO L225 Difference]: With dead ends: 67 [2019-01-12 11:24:39,242 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 11:24:39,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:24:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 11:24:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 11:24:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 11:24:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-01-12 11:24:39,249 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 41 [2019-01-12 11:24:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:39,250 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-01-12 11:24:39,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 11:24:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-01-12 11:24:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 11:24:39,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:39,251 INFO L402 BasicCegarLoop]: trace histogram [19, 10, 9, 1, 1, 1, 1, 1] [2019-01-12 11:24:39,251 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash 480925017, now seen corresponding path program 9 times [2019-01-12 11:24:39,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:39,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:39,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 187 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:24:39,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:39,487 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 11:24:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:39,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-12 11:24:39,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:39,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 37 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:40,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:40,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2019-01-12 11:24:40,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 11:24:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 11:24:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:24:40,059 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 32 states. [2019-01-12 11:24:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:40,300 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2019-01-12 11:24:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 11:24:40,301 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2019-01-12 11:24:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:40,302 INFO L225 Difference]: With dead ends: 90 [2019-01-12 11:24:40,302 INFO L226 Difference]: Without dead ends: 67 [2019-01-12 11:24:40,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:24:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-12 11:24:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-12 11:24:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 11:24:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-01-12 11:24:40,311 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 43 [2019-01-12 11:24:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:40,311 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-01-12 11:24:40,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 11:24:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-01-12 11:24:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 11:24:40,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:40,313 INFO L402 BasicCegarLoop]: trace histogram [30, 19, 11, 1, 1, 1, 1, 1] [2019-01-12 11:24:40,313 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash -252213426, now seen corresponding path program 10 times [2019-01-12 11:24:40,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:40,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:40,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:40,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-01-12 11:24:40,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:40,551 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 11:24:40,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:40,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:40,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:40,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-01-12 11:24:40,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:40,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 11:24:40,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 11:24:40,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 11:24:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:24:40,706 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 14 states. [2019-01-12 11:24:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:40,990 INFO L93 Difference]: Finished difference Result 111 states and 150 transitions. [2019-01-12 11:24:40,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 11:24:40,990 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-01-12 11:24:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:40,992 INFO L225 Difference]: With dead ends: 111 [2019-01-12 11:24:40,992 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 11:24:40,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:24:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 11:24:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 11:24:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 11:24:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-01-12 11:24:41,002 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 65 [2019-01-12 11:24:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:41,002 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-01-12 11:24:41,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 11:24:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2019-01-12 11:24:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 11:24:41,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:41,004 INFO L402 BasicCegarLoop]: trace histogram [31, 19, 12, 1, 1, 1, 1, 1] [2019-01-12 11:24:41,005 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash -909350767, now seen corresponding path program 11 times [2019-01-12 11:24:41,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:41,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-01-12 11:24:41,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:41,248 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 11:24:41,257 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:24:41,313 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-01-12 11:24:41,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:41,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-01-12 11:24:41,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:41,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 11:24:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 11:24:41,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 11:24:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:24:41,354 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 15 states. [2019-01-12 11:24:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:41,468 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2019-01-12 11:24:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 11:24:41,471 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-01-12 11:24:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:41,472 INFO L225 Difference]: With dead ends: 113 [2019-01-12 11:24:41,472 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 11:24:41,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:24:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 11:24:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-12 11:24:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 11:24:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2019-01-12 11:24:41,485 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 67 [2019-01-12 11:24:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:41,486 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-01-12 11:24:41,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 11:24:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2019-01-12 11:24:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 11:24:41,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:41,489 INFO L402 BasicCegarLoop]: trace histogram [32, 19, 13, 1, 1, 1, 1, 1] [2019-01-12 11:24:41,489 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1058142956, now seen corresponding path program 12 times [2019-01-12 11:24:41,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:41,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 518 proven. 182 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-01-12 11:24:41,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:41,676 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 11:24:41,690 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:24:41,778 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2019-01-12 11:24:41,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:41,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 507 proven. 361 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-12 11:24:42,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:42,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 36 [2019-01-12 11:24:42,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 11:24:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 11:24:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 11:24:42,282 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 36 states. [2019-01-12 11:24:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:42,634 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2019-01-12 11:24:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 11:24:42,635 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-01-12 11:24:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:42,636 INFO L225 Difference]: With dead ends: 118 [2019-01-12 11:24:42,636 INFO L226 Difference]: Without dead ends: 75 [2019-01-12 11:24:42,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 11:24:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-12 11:24:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-01-12 11:24:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 11:24:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-01-12 11:24:42,646 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 69 [2019-01-12 11:24:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:42,646 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-01-12 11:24:42,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 11:24:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-01-12 11:24:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 11:24:42,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:42,649 INFO L402 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1, 1, 1] [2019-01-12 11:24:42,650 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1556548956, now seen corresponding path program 13 times [2019-01-12 11:24:42,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:42,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:42,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:42,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:42,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:42,920 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 11:24:42,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:42,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:43,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:43,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 11:24:43,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 11:24:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 11:24:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:24:43,006 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 17 states. [2019-01-12 11:24:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:43,196 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2019-01-12 11:24:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 11:24:43,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2019-01-12 11:24:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:43,206 INFO L225 Difference]: With dead ends: 121 [2019-01-12 11:24:43,206 INFO L226 Difference]: Without dead ends: 76 [2019-01-12 11:24:43,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:24:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-12 11:24:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-12 11:24:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 11:24:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2019-01-12 11:24:43,214 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 73 [2019-01-12 11:24:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:43,214 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2019-01-12 11:24:43,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 11:24:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2019-01-12 11:24:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 11:24:43,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:43,217 INFO L402 BasicCegarLoop]: trace histogram [35, 20, 15, 1, 1, 1, 1, 1] [2019-01-12 11:24:43,218 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash 353631135, now seen corresponding path program 14 times [2019-01-12 11:24:43,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:43,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:43,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:43,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:43,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:43,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:43,723 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 11:24:43,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:43,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:43,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:43,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:43,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:43,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 11:24:43,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 11:24:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 11:24:43,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 11:24:43,813 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand 18 states. [2019-01-12 11:24:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:43,882 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2019-01-12 11:24:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 11:24:43,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2019-01-12 11:24:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:43,884 INFO L225 Difference]: With dead ends: 123 [2019-01-12 11:24:43,884 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 11:24:43,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 11:24:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 11:24:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-12 11:24:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 11:24:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2019-01-12 11:24:43,892 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 75 [2019-01-12 11:24:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:43,893 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2019-01-12 11:24:43,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 11:24:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2019-01-12 11:24:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 11:24:43,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:43,895 INFO L402 BasicCegarLoop]: trace histogram [36, 20, 16, 1, 1, 1, 1, 1] [2019-01-12 11:24:43,896 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:43,897 INFO L82 PathProgramCache]: Analyzing trace with hash -304192222, now seen corresponding path program 15 times [2019-01-12 11:24:43,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:43,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:43,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:43,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:44,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:44,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:44,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:44,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-12 11:24:44,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:44,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:44,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:44,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 11:24:44,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 11:24:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 11:24:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:24:44,309 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand 19 states. [2019-01-12 11:24:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:44,391 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2019-01-12 11:24:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 11:24:44,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2019-01-12 11:24:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:44,395 INFO L225 Difference]: With dead ends: 125 [2019-01-12 11:24:44,395 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 11:24:44,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:24:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 11:24:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-12 11:24:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 11:24:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-01-12 11:24:44,400 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 77 [2019-01-12 11:24:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:44,401 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-01-12 11:24:44,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 11:24:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-01-12 11:24:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-12 11:24:44,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:44,404 INFO L402 BasicCegarLoop]: trace histogram [37, 20, 17, 1, 1, 1, 1, 1] [2019-01-12 11:24:44,404 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:44,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1112245787, now seen corresponding path program 16 times [2019-01-12 11:24:44,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:44,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:44,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:44,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:44,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:44,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:44,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:44,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:44,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:44,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:44,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 11:24:44,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 11:24:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 11:24:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-12 11:24:44,749 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 20 states. [2019-01-12 11:24:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:45,127 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2019-01-12 11:24:45,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 11:24:45,128 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2019-01-12 11:24:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:45,129 INFO L225 Difference]: With dead ends: 127 [2019-01-12 11:24:45,129 INFO L226 Difference]: Without dead ends: 82 [2019-01-12 11:24:45,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-12 11:24:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-12 11:24:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-12 11:24:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-12 11:24:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-01-12 11:24:45,135 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 79 [2019-01-12 11:24:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:45,135 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-01-12 11:24:45,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 11:24:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-01-12 11:24:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 11:24:45,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:45,138 INFO L402 BasicCegarLoop]: trace histogram [38, 20, 18, 1, 1, 1, 1, 1] [2019-01-12 11:24:45,140 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash -262641176, now seen corresponding path program 17 times [2019-01-12 11:24:45,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:45,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:45,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:45,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:24:45,523 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-01-12 11:24:45,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:45,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:45,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:45,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-12 11:24:45,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 11:24:45,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 11:24:45,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:24:45,560 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 21 states. [2019-01-12 11:24:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:45,662 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2019-01-12 11:24:45,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 11:24:45,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-01-12 11:24:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:45,664 INFO L225 Difference]: With dead ends: 129 [2019-01-12 11:24:45,665 INFO L226 Difference]: Without dead ends: 84 [2019-01-12 11:24:45,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:24:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-12 11:24:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-12 11:24:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-12 11:24:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-01-12 11:24:45,669 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 81 [2019-01-12 11:24:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:45,670 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-01-12 11:24:45,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 11:24:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-01-12 11:24:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-12 11:24:45,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:45,673 INFO L402 BasicCegarLoop]: trace histogram [39, 20, 19, 1, 1, 1, 1, 1] [2019-01-12 11:24:45,673 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash 163603755, now seen corresponding path program 18 times [2019-01-12 11:24:45,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:45,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:45,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 380 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:24:46,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:46,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:46,210 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:24:46,299 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-01-12 11:24:46,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:46,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 779 proven. 400 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-01-12 11:24:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:47,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2019-01-12 11:24:47,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-12 11:24:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-12 11:24:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:24:47,509 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 43 states. [2019-01-12 11:24:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:47,800 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2019-01-12 11:24:47,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 11:24:47,801 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-01-12 11:24:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:47,802 INFO L225 Difference]: With dead ends: 134 [2019-01-12 11:24:47,803 INFO L226 Difference]: Without dead ends: 89 [2019-01-12 11:24:47,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:24:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-12 11:24:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-01-12 11:24:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-12 11:24:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2019-01-12 11:24:47,807 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 83 [2019-01-12 11:24:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:47,808 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2019-01-12 11:24:47,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-12 11:24:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2019-01-12 11:24:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 11:24:47,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:47,811 INFO L402 BasicCegarLoop]: trace histogram [41, 21, 20, 1, 1, 1, 1, 1] [2019-01-12 11:24:47,811 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2131049869, now seen corresponding path program 19 times [2019-01-12 11:24:47,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:47,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 11:24:48,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:48,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:48,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:48,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 11:24:48,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:48,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 11:24:48,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 11:24:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 11:24:48,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:24:48,758 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 23 states. [2019-01-12 11:24:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:48,886 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2019-01-12 11:24:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 11:24:48,890 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2019-01-12 11:24:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:48,891 INFO L225 Difference]: With dead ends: 137 [2019-01-12 11:24:48,891 INFO L226 Difference]: Without dead ends: 90 [2019-01-12 11:24:48,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:24:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-12 11:24:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-12 11:24:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-12 11:24:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-01-12 11:24:48,901 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 87 [2019-01-12 11:24:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:48,901 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-01-12 11:24:48,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 11:24:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2019-01-12 11:24:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 11:24:48,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:48,902 INFO L402 BasicCegarLoop]: trace histogram [42, 21, 21, 1, 1, 1, 1, 1] [2019-01-12 11:24:48,902 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1165754230, now seen corresponding path program 20 times [2019-01-12 11:24:48,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:48,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:48,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 11:24:49,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:49,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:49,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:49,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:49,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:49,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 11:24:49,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:49,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 11:24:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 11:24:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 11:24:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-12 11:24:49,819 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 24 states. [2019-01-12 11:24:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:49,974 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2019-01-12 11:24:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 11:24:49,976 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 89 [2019-01-12 11:24:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:49,977 INFO L225 Difference]: With dead ends: 139 [2019-01-12 11:24:49,977 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 11:24:49,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-12 11:24:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 11:24:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-12 11:24:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-12 11:24:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2019-01-12 11:24:49,981 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 89 [2019-01-12 11:24:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:49,982 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2019-01-12 11:24:49,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 11:24:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2019-01-12 11:24:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 11:24:49,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:49,985 INFO L402 BasicCegarLoop]: trace histogram [43, 22, 21, 1, 1, 1, 1, 1] [2019-01-12 11:24:49,985 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash -291371079, now seen corresponding path program 21 times [2019-01-12 11:24:49,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:49,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:49,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:49,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:49,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 943 proven. 506 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 11:24:50,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:50,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:50,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:50,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-12 11:24:50,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:50,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 85 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:24:51,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:51,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 45] total 68 [2019-01-12 11:24:51,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-12 11:24:51,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-12 11:24:51,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-12 11:24:51,910 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 68 states. [2019-01-12 11:24:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:52,390 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2019-01-12 11:24:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-12 11:24:52,391 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 91 [2019-01-12 11:24:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:52,393 INFO L225 Difference]: With dead ends: 186 [2019-01-12 11:24:52,393 INFO L226 Difference]: Without dead ends: 139 [2019-01-12 11:24:52,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-12 11:24:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-12 11:24:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-01-12 11:24:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-12 11:24:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2019-01-12 11:24:52,399 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 91 [2019-01-12 11:24:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:52,400 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2019-01-12 11:24:52,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-12 11:24:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2019-01-12 11:24:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-12 11:24:52,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:52,403 INFO L402 BasicCegarLoop]: trace histogram [66, 43, 23, 1, 1, 1, 1, 1] [2019-01-12 11:24:52,404 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1457447318, now seen corresponding path program 22 times [2019-01-12 11:24:52,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:52,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-01-12 11:24:52,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:52,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:52,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:52,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:52,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:52,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-01-12 11:24:52,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:52,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-12 11:24:52,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 11:24:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 11:24:52,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:24:52,883 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand 26 states. [2019-01-12 11:24:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:52,988 INFO L93 Difference]: Finished difference Result 231 states and 318 transitions. [2019-01-12 11:24:52,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 11:24:52,990 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 137 [2019-01-12 11:24:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:52,991 INFO L225 Difference]: With dead ends: 231 [2019-01-12 11:24:52,992 INFO L226 Difference]: Without dead ends: 140 [2019-01-12 11:24:52,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:24:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-12 11:24:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-01-12 11:24:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-12 11:24:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2019-01-12 11:24:52,997 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 137 [2019-01-12 11:24:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:52,997 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2019-01-12 11:24:52,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 11:24:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2019-01-12 11:24:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:24:52,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:52,998 INFO L402 BasicCegarLoop]: trace histogram [67, 43, 24, 1, 1, 1, 1, 1] [2019-01-12 11:24:52,998 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1545237677, now seen corresponding path program 23 times [2019-01-12 11:24:52,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:53,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-01-12 11:24:53,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:53,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:53,520 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:24:53,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2019-01-12 11:24:53,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:53,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-01-12 11:24:53,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:53,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-12 11:24:53,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 11:24:53,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 11:24:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-01-12 11:24:53,745 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand 27 states. [2019-01-12 11:24:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:53,969 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2019-01-12 11:24:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 11:24:53,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 139 [2019-01-12 11:24:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:53,972 INFO L225 Difference]: With dead ends: 233 [2019-01-12 11:24:53,972 INFO L226 Difference]: Without dead ends: 142 [2019-01-12 11:24:53,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-01-12 11:24:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-12 11:24:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-01-12 11:24:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-12 11:24:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2019-01-12 11:24:53,977 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 139 [2019-01-12 11:24:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:53,977 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2019-01-12 11:24:53,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 11:24:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2019-01-12 11:24:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 11:24:53,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:53,978 INFO L402 BasicCegarLoop]: trace histogram [68, 43, 25, 1, 1, 1, 1, 1] [2019-01-12 11:24:53,978 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash 907494960, now seen corresponding path program 24 times [2019-01-12 11:24:53,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:53,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:53,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2210 proven. 650 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-01-12 11:24:54,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:54,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:54,443 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:24:54,542 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2019-01-12 11:24:54,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:54,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2175 proven. 1849 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-01-12 11:24:56,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:56,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 46] total 72 [2019-01-12 11:24:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-12 11:24:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-12 11:24:56,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-12 11:24:56,072 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 72 states. [2019-01-12 11:24:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:56,646 INFO L93 Difference]: Finished difference Result 238 states and 328 transitions. [2019-01-12 11:24:56,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-12 11:24:56,647 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-01-12 11:24:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:56,648 INFO L225 Difference]: With dead ends: 238 [2019-01-12 11:24:56,648 INFO L226 Difference]: Without dead ends: 147 [2019-01-12 11:24:56,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-12 11:24:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-12 11:24:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-01-12 11:24:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-12 11:24:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2019-01-12 11:24:56,653 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 141 [2019-01-12 11:24:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:56,654 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2019-01-12 11:24:56,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-12 11:24:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2019-01-12 11:24:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 11:24:56,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:56,655 INFO L402 BasicCegarLoop]: trace histogram [70, 44, 26, 1, 1, 1, 1, 1] [2019-01-12 11:24:56,655 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash 350039160, now seen corresponding path program 25 times [2019-01-12 11:24:56,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:56,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:56,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:56,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:56,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:57,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:57,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:57,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:57,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:57,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-12 11:24:57,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 11:24:57,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 11:24:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-12 11:24:57,370 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 29 states. [2019-01-12 11:24:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:57,470 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2019-01-12 11:24:57,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 11:24:57,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 145 [2019-01-12 11:24:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:57,473 INFO L225 Difference]: With dead ends: 241 [2019-01-12 11:24:57,473 INFO L226 Difference]: Without dead ends: 148 [2019-01-12 11:24:57,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-12 11:24:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-12 11:24:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-01-12 11:24:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-12 11:24:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2019-01-12 11:24:57,482 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 145 [2019-01-12 11:24:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:57,483 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2019-01-12 11:24:57,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 11:24:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2019-01-12 11:24:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 11:24:57,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:57,487 INFO L402 BasicCegarLoop]: trace histogram [71, 44, 27, 1, 1, 1, 1, 1] [2019-01-12 11:24:57,487 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:57,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1979084869, now seen corresponding path program 26 times [2019-01-12 11:24:57,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:57,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:57,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:57,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:57,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:57,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:57,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:57,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:57,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:57,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:57,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:57,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-12 11:24:57,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-12 11:24:57,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-12 11:24:57,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-12 11:24:57,968 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand 30 states. [2019-01-12 11:24:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:58,080 INFO L93 Difference]: Finished difference Result 243 states and 332 transitions. [2019-01-12 11:24:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-12 11:24:58,081 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 147 [2019-01-12 11:24:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:58,083 INFO L225 Difference]: With dead ends: 243 [2019-01-12 11:24:58,083 INFO L226 Difference]: Without dead ends: 150 [2019-01-12 11:24:58,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-12 11:24:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-12 11:24:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-01-12 11:24:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 11:24:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2019-01-12 11:24:58,090 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 147 [2019-01-12 11:24:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:58,090 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2019-01-12 11:24:58,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-12 11:24:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2019-01-12 11:24:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 11:24:58,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:58,091 INFO L402 BasicCegarLoop]: trace histogram [72, 44, 28, 1, 1, 1, 1, 1] [2019-01-12 11:24:58,091 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1705651774, now seen corresponding path program 27 times [2019-01-12 11:24:58,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:58,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:58,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:58,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:58,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:58,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:58,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:58,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:58,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-01-12 11:24:58,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:58,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:58,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:58,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-01-12 11:24:58,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 11:24:58,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 11:24:58,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-12 11:24:58,646 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand 31 states. [2019-01-12 11:24:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:58,898 INFO L93 Difference]: Finished difference Result 245 states and 334 transitions. [2019-01-12 11:24:58,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 11:24:58,899 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 149 [2019-01-12 11:24:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:58,900 INFO L225 Difference]: With dead ends: 245 [2019-01-12 11:24:58,901 INFO L226 Difference]: Without dead ends: 152 [2019-01-12 11:24:58,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-12 11:24:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-12 11:24:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-01-12 11:24:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-12 11:24:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2019-01-12 11:24:58,913 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 149 [2019-01-12 11:24:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:58,915 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2019-01-12 11:24:58,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 11:24:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2019-01-12 11:24:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-12 11:24:58,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:58,919 INFO L402 BasicCegarLoop]: trace histogram [73, 44, 29, 1, 1, 1, 1, 1] [2019-01-12 11:24:58,919 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash -610453503, now seen corresponding path program 28 times [2019-01-12 11:24:58,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:58,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:58,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:59,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:59,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:59,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:59,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:59,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:24:59,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:59,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-01-12 11:24:59,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 11:24:59,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 11:24:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:24:59,727 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand 32 states. [2019-01-12 11:25:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:00,223 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2019-01-12 11:25:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 11:25:00,224 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 151 [2019-01-12 11:25:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:00,226 INFO L225 Difference]: With dead ends: 247 [2019-01-12 11:25:00,226 INFO L226 Difference]: Without dead ends: 154 [2019-01-12 11:25:00,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:25:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-12 11:25:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-01-12 11:25:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-12 11:25:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2019-01-12 11:25:00,233 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 151 [2019-01-12 11:25:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:00,233 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2019-01-12 11:25:00,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 11:25:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2019-01-12 11:25:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-12 11:25:00,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:00,234 INFO L402 BasicCegarLoop]: trace histogram [74, 44, 30, 1, 1, 1, 1, 1] [2019-01-12 11:25:00,234 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1594565372, now seen corresponding path program 29 times [2019-01-12 11:25:00,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:00,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:00,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:25:01,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:01,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:01,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:01,441 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 75 check-sat command(s) [2019-01-12 11:25:01,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:01,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:25:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-12 11:25:01,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-12 11:25:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-12 11:25:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 11:25:01,481 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand 33 states. [2019-01-12 11:25:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:01,638 INFO L93 Difference]: Finished difference Result 249 states and 338 transitions. [2019-01-12 11:25:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 11:25:01,639 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 153 [2019-01-12 11:25:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:01,640 INFO L225 Difference]: With dead ends: 249 [2019-01-12 11:25:01,640 INFO L226 Difference]: Without dead ends: 156 [2019-01-12 11:25:01,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 11:25:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-12 11:25:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-01-12 11:25:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-12 11:25:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2019-01-12 11:25:01,647 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 153 [2019-01-12 11:25:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:01,648 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2019-01-12 11:25:01,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-12 11:25:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2019-01-12 11:25:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-12 11:25:01,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:01,652 INFO L402 BasicCegarLoop]: trace histogram [75, 44, 31, 1, 1, 1, 1, 1] [2019-01-12 11:25:01,652 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1861700935, now seen corresponding path program 30 times [2019-01-12 11:25:01,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:01,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:01,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:01,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2784 proven. 992 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-01-12 11:25:02,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:02,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:02,274 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:02,374 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2019-01-12 11:25:02,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:02,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2759 proven. 1936 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-01-12 11:25:04,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:04,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 47] total 79 [2019-01-12 11:25:04,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-12 11:25:04,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-12 11:25:04,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 11:25:04,406 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand 79 states. [2019-01-12 11:25:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:05,293 INFO L93 Difference]: Finished difference Result 254 states and 346 transitions. [2019-01-12 11:25:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-12 11:25:05,294 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-01-12 11:25:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:05,295 INFO L225 Difference]: With dead ends: 254 [2019-01-12 11:25:05,295 INFO L226 Difference]: Without dead ends: 161 [2019-01-12 11:25:05,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 11:25:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-12 11:25:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-01-12 11:25:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 11:25:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-01-12 11:25:05,303 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 155 [2019-01-12 11:25:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:05,303 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-01-12 11:25:05,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-12 11:25:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-01-12 11:25:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 11:25:05,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:05,305 INFO L402 BasicCegarLoop]: trace histogram [77, 45, 32, 1, 1, 1, 1, 1] [2019-01-12 11:25:05,305 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1133508465, now seen corresponding path program 31 times [2019-01-12 11:25:05,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:05,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:05,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:05,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:05,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:06,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:06,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:06,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:06,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:06,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-12 11:25:06,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 11:25:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 11:25:06,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 11:25:06,959 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 35 states. [2019-01-12 11:25:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:07,110 INFO L93 Difference]: Finished difference Result 257 states and 348 transitions. [2019-01-12 11:25:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 11:25:07,112 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 159 [2019-01-12 11:25:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:07,114 INFO L225 Difference]: With dead ends: 257 [2019-01-12 11:25:07,114 INFO L226 Difference]: Without dead ends: 162 [2019-01-12 11:25:07,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 11:25:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-12 11:25:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-01-12 11:25:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-12 11:25:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 207 transitions. [2019-01-12 11:25:07,121 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 207 transitions. Word has length 159 [2019-01-12 11:25:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:07,122 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 207 transitions. [2019-01-12 11:25:07,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 11:25:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 207 transitions. [2019-01-12 11:25:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-12 11:25:07,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:07,127 INFO L402 BasicCegarLoop]: trace histogram [78, 45, 33, 1, 1, 1, 1, 1] [2019-01-12 11:25:07,127 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:07,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:07,127 INFO L82 PathProgramCache]: Analyzing trace with hash 320862866, now seen corresponding path program 32 times [2019-01-12 11:25:07,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:07,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:07,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:07,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:08,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:08,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:08,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:08,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:08,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:08,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:08,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:08,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-01-12 11:25:08,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 11:25:08,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 11:25:08,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 11:25:08,300 INFO L87 Difference]: Start difference. First operand 162 states and 207 transitions. Second operand 36 states. [2019-01-12 11:25:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:08,541 INFO L93 Difference]: Finished difference Result 259 states and 350 transitions. [2019-01-12 11:25:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 11:25:08,542 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 161 [2019-01-12 11:25:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:08,544 INFO L225 Difference]: With dead ends: 259 [2019-01-12 11:25:08,544 INFO L226 Difference]: Without dead ends: 164 [2019-01-12 11:25:08,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 11:25:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-12 11:25:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-01-12 11:25:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-12 11:25:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2019-01-12 11:25:08,552 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 161 [2019-01-12 11:25:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:08,552 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2019-01-12 11:25:08,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 11:25:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2019-01-12 11:25:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 11:25:08,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:08,553 INFO L402 BasicCegarLoop]: trace histogram [79, 45, 34, 1, 1, 1, 1, 1] [2019-01-12 11:25:08,553 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:08,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2107340757, now seen corresponding path program 33 times [2019-01-12 11:25:08,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:08,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:08,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:08,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:09,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:09,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2019-01-12 11:25:09,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:09,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:09,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:09,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-01-12 11:25:09,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-12 11:25:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-12 11:25:09,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 11:25:09,678 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand 37 states. [2019-01-12 11:25:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:10,078 INFO L93 Difference]: Finished difference Result 261 states and 352 transitions. [2019-01-12 11:25:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 11:25:10,081 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 163 [2019-01-12 11:25:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:10,082 INFO L225 Difference]: With dead ends: 261 [2019-01-12 11:25:10,082 INFO L226 Difference]: Without dead ends: 166 [2019-01-12 11:25:10,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 11:25:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-12 11:25:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-01-12 11:25:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-12 11:25:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2019-01-12 11:25:10,091 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 163 [2019-01-12 11:25:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:10,092 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2019-01-12 11:25:10,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-12 11:25:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2019-01-12 11:25:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 11:25:10,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:10,097 INFO L402 BasicCegarLoop]: trace histogram [80, 45, 35, 1, 1, 1, 1, 1] [2019-01-12 11:25:10,097 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 925675608, now seen corresponding path program 34 times [2019-01-12 11:25:10,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:10,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:10,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:10,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:10,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:11,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:11,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:11,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:11,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:11,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:11,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:11,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:11,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-01-12 11:25:11,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-12 11:25:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-12 11:25:11,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 11:25:11,994 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand 38 states. [2019-01-12 11:25:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:12,130 INFO L93 Difference]: Finished difference Result 263 states and 354 transitions. [2019-01-12 11:25:12,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-12 11:25:12,131 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 165 [2019-01-12 11:25:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:12,133 INFO L225 Difference]: With dead ends: 263 [2019-01-12 11:25:12,133 INFO L226 Difference]: Without dead ends: 168 [2019-01-12 11:25:12,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 11:25:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-12 11:25:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-01-12 11:25:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-12 11:25:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2019-01-12 11:25:12,139 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 165 [2019-01-12 11:25:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:12,141 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2019-01-12 11:25:12,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-12 11:25:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2019-01-12 11:25:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 11:25:12,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:12,142 INFO L402 BasicCegarLoop]: trace histogram [81, 45, 36, 1, 1, 1, 1, 1] [2019-01-12 11:25:12,142 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash -783166437, now seen corresponding path program 35 times [2019-01-12 11:25:12,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:12,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:12,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:12,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:12,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:12,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:12,858 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:12,964 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2019-01-12 11:25:12,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:12,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:13,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:13,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-01-12 11:25:13,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-12 11:25:13,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-12 11:25:13,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 11:25:13,017 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 39 states. [2019-01-12 11:25:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:13,175 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2019-01-12 11:25:13,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 11:25:13,177 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 167 [2019-01-12 11:25:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:13,179 INFO L225 Difference]: With dead ends: 265 [2019-01-12 11:25:13,179 INFO L226 Difference]: Without dead ends: 170 [2019-01-12 11:25:13,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 11:25:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-12 11:25:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-01-12 11:25:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-12 11:25:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 215 transitions. [2019-01-12 11:25:13,184 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 215 transitions. Word has length 167 [2019-01-12 11:25:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:13,185 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 215 transitions. [2019-01-12 11:25:13,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-12 11:25:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2019-01-12 11:25:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 11:25:13,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:13,186 INFO L402 BasicCegarLoop]: trace histogram [82, 45, 37, 1, 1, 1, 1, 1] [2019-01-12 11:25:13,186 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:13,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1992102686, now seen corresponding path program 36 times [2019-01-12 11:25:13,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:13,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:13,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:13,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:13,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:14,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:14,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:14,121 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:14,303 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2019-01-12 11:25:14,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:14,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:14,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:14,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-01-12 11:25:14,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-12 11:25:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-12 11:25:14,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 11:25:14,365 INFO L87 Difference]: Start difference. First operand 170 states and 215 transitions. Second operand 40 states. [2019-01-12 11:25:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:15,358 INFO L93 Difference]: Finished difference Result 267 states and 358 transitions. [2019-01-12 11:25:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 11:25:15,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 169 [2019-01-12 11:25:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:15,361 INFO L225 Difference]: With dead ends: 267 [2019-01-12 11:25:15,361 INFO L226 Difference]: Without dead ends: 172 [2019-01-12 11:25:15,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 11:25:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-01-12 11:25:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-01-12 11:25:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-12 11:25:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2019-01-12 11:25:15,367 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 169 [2019-01-12 11:25:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:15,367 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2019-01-12 11:25:15,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-12 11:25:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2019-01-12 11:25:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-12 11:25:15,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:15,372 INFO L402 BasicCegarLoop]: trace histogram [83, 45, 38, 1, 1, 1, 1, 1] [2019-01-12 11:25:15,372 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:15,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1851039073, now seen corresponding path program 37 times [2019-01-12 11:25:15,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:15,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:15,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:15,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:16,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:16,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:16,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:16,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:16,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-12 11:25:16,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-12 11:25:16,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-12 11:25:16,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 11:25:16,650 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand 41 states. [2019-01-12 11:25:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:16,801 INFO L93 Difference]: Finished difference Result 269 states and 360 transitions. [2019-01-12 11:25:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-12 11:25:16,802 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 171 [2019-01-12 11:25:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:16,803 INFO L225 Difference]: With dead ends: 269 [2019-01-12 11:25:16,803 INFO L226 Difference]: Without dead ends: 174 [2019-01-12 11:25:16,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 11:25:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-12 11:25:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-01-12 11:25:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-12 11:25:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2019-01-12 11:25:16,809 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 171 [2019-01-12 11:25:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:16,809 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2019-01-12 11:25:16,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-12 11:25:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2019-01-12 11:25:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-01-12 11:25:16,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:16,810 INFO L402 BasicCegarLoop]: trace histogram [84, 45, 39, 1, 1, 1, 1, 1] [2019-01-12 11:25:16,811 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash -567106844, now seen corresponding path program 38 times [2019-01-12 11:25:16,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:16,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:19,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:19,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:19,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:19,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:19,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:19,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:19,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:19,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-01-12 11:25:19,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-12 11:25:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-12 11:25:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 11:25:19,113 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand 42 states. [2019-01-12 11:25:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:19,345 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2019-01-12 11:25:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-12 11:25:19,346 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 173 [2019-01-12 11:25:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:19,347 INFO L225 Difference]: With dead ends: 271 [2019-01-12 11:25:19,347 INFO L226 Difference]: Without dead ends: 176 [2019-01-12 11:25:19,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 11:25:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-12 11:25:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-01-12 11:25:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-12 11:25:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2019-01-12 11:25:19,352 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 173 [2019-01-12 11:25:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:19,352 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2019-01-12 11:25:19,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-12 11:25:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2019-01-12 11:25:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-12 11:25:19,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:19,356 INFO L402 BasicCegarLoop]: trace histogram [85, 45, 40, 1, 1, 1, 1, 1] [2019-01-12 11:25:19,356 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:19,356 INFO L82 PathProgramCache]: Analyzing trace with hash -828025945, now seen corresponding path program 39 times [2019-01-12 11:25:19,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:19,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:19,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:19,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:20,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:20,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:20,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:21,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2019-01-12 11:25:21,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:21,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:21,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-01-12 11:25:21,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-12 11:25:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-12 11:25:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:25:21,165 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand 43 states. [2019-01-12 11:25:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:21,288 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2019-01-12 11:25:21,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 11:25:21,289 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 175 [2019-01-12 11:25:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:21,291 INFO L225 Difference]: With dead ends: 273 [2019-01-12 11:25:21,291 INFO L226 Difference]: Without dead ends: 178 [2019-01-12 11:25:21,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:25:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-12 11:25:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-01-12 11:25:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-12 11:25:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2019-01-12 11:25:21,299 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 175 [2019-01-12 11:25:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:21,300 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2019-01-12 11:25:21,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-12 11:25:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2019-01-12 11:25:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 11:25:21,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:21,305 INFO L402 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1] [2019-01-12 11:25:21,305 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:21,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1831788458, now seen corresponding path program 40 times [2019-01-12 11:25:21,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:21,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:21,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:22,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:22,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:22,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:22,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:22,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:22,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:22,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:22,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-01-12 11:25:22,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 11:25:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 11:25:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 11:25:22,938 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand 44 states. [2019-01-12 11:25:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:23,093 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2019-01-12 11:25:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-12 11:25:23,095 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 177 [2019-01-12 11:25:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:23,097 INFO L225 Difference]: With dead ends: 275 [2019-01-12 11:25:23,097 INFO L226 Difference]: Without dead ends: 180 [2019-01-12 11:25:23,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 11:25:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-12 11:25:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-01-12 11:25:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-12 11:25:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2019-01-12 11:25:23,103 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 177 [2019-01-12 11:25:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:23,104 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2019-01-12 11:25:23,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 11:25:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2019-01-12 11:25:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-01-12 11:25:23,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:23,105 INFO L402 BasicCegarLoop]: trace histogram [87, 45, 42, 1, 1, 1, 1, 1] [2019-01-12 11:25:23,105 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:23,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1887078675, now seen corresponding path program 41 times [2019-01-12 11:25:23,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:23,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:23,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:23,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:23,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:23,988 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:24,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2019-01-12 11:25:24,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:24,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:24,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:24,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-01-12 11:25:24,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-12 11:25:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-12 11:25:24,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 11:25:24,160 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand 45 states. [2019-01-12 11:25:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:24,390 INFO L93 Difference]: Finished difference Result 277 states and 368 transitions. [2019-01-12 11:25:24,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-12 11:25:24,392 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 179 [2019-01-12 11:25:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:24,393 INFO L225 Difference]: With dead ends: 277 [2019-01-12 11:25:24,393 INFO L226 Difference]: Without dead ends: 182 [2019-01-12 11:25:24,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 11:25:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-12 11:25:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-01-12 11:25:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-12 11:25:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2019-01-12 11:25:24,400 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 179 [2019-01-12 11:25:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:24,400 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2019-01-12 11:25:24,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-12 11:25:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2019-01-12 11:25:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-12 11:25:24,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:24,401 INFO L402 BasicCegarLoop]: trace histogram [88, 45, 43, 1, 1, 1, 1, 1] [2019-01-12 11:25:24,401 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1989364080, now seen corresponding path program 42 times [2019-01-12 11:25:24,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:24,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:24,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:24,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:24,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 1892 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 11:25:25,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:25,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:25,417 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:25,874 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 88 check-sat command(s) [2019-01-12 11:25:25,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:25,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3913 proven. 2025 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2019-01-12 11:25:28,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:28,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 48] total 92 [2019-01-12 11:25:28,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-12 11:25:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-12 11:25:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-12 11:25:28,237 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 92 states. [2019-01-12 11:25:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:29,139 INFO L93 Difference]: Finished difference Result 282 states and 376 transitions. [2019-01-12 11:25:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-12 11:25:29,140 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-01-12 11:25:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:29,142 INFO L225 Difference]: With dead ends: 282 [2019-01-12 11:25:29,142 INFO L226 Difference]: Without dead ends: 187 [2019-01-12 11:25:29,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-12 11:25:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-12 11:25:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-12 11:25:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-12 11:25:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 232 transitions. [2019-01-12 11:25:29,150 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 232 transitions. Word has length 181 [2019-01-12 11:25:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:29,152 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 232 transitions. [2019-01-12 11:25:29,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-12 11:25:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 232 transitions. [2019-01-12 11:25:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-12 11:25:29,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:29,156 INFO L402 BasicCegarLoop]: trace histogram [90, 46, 44, 1, 1, 1, 1, 1] [2019-01-12 11:25:29,156 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1359863992, now seen corresponding path program 43 times [2019-01-12 11:25:29,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:29,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-01-12 11:25:30,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:30,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:30,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:30,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-01-12 11:25:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-12 11:25:30,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-12 11:25:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-12 11:25:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 11:25:30,495 INFO L87 Difference]: Start difference. First operand 186 states and 232 transitions. Second operand 47 states. [2019-01-12 11:25:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:32,303 INFO L93 Difference]: Finished difference Result 285 states and 378 transitions. [2019-01-12 11:25:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-12 11:25:32,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 185 [2019-01-12 11:25:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:32,306 INFO L225 Difference]: With dead ends: 285 [2019-01-12 11:25:32,307 INFO L226 Difference]: Without dead ends: 188 [2019-01-12 11:25:32,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 11:25:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-12 11:25:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-01-12 11:25:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-12 11:25:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2019-01-12 11:25:32,322 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 185 [2019-01-12 11:25:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:32,324 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2019-01-12 11:25:32,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-12 11:25:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2019-01-12 11:25:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-12 11:25:32,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:32,330 INFO L402 BasicCegarLoop]: trace histogram [91, 46, 45, 1, 1, 1, 1, 1] [2019-01-12 11:25:32,330 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:32,331 INFO L82 PathProgramCache]: Analyzing trace with hash -389643013, now seen corresponding path program 44 times [2019-01-12 11:25:32,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:32,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-01-12 11:25:33,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:33,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:33,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:33,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:33,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:33,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-01-12 11:25:33,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:33,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-01-12 11:25:33,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-12 11:25:33,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-12 11:25:33,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 11:25:33,718 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand 48 states. [2019-01-12 11:25:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:33,905 INFO L93 Difference]: Finished difference Result 287 states and 380 transitions. [2019-01-12 11:25:33,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-12 11:25:33,907 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 187 [2019-01-12 11:25:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:33,909 INFO L225 Difference]: With dead ends: 287 [2019-01-12 11:25:33,909 INFO L226 Difference]: Without dead ends: 190 [2019-01-12 11:25:33,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 11:25:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-12 11:25:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-01-12 11:25:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-01-12 11:25:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 236 transitions. [2019-01-12 11:25:33,915 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 236 transitions. Word has length 187 [2019-01-12 11:25:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:33,916 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 236 transitions. [2019-01-12 11:25:33,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-12 11:25:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 236 transitions. [2019-01-12 11:25:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-12 11:25:33,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:33,920 INFO L402 BasicCegarLoop]: trace histogram [92, 46, 46, 1, 1, 1, 1, 1] [2019-01-12 11:25:33,921 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:33,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:33,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1961305214, now seen corresponding path program 45 times [2019-01-12 11:25:33,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:33,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:33,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4277 proven. 2162 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-01-12 11:25:35,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:35,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:35,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:35,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-01-12 11:25:35,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:35,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:37,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:37,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 94] total 94 [2019-01-12 11:25:37,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-12 11:25:37,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-12 11:25:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-01-12 11:25:37,881 INFO L87 Difference]: Start difference. First operand 190 states and 236 transitions. Second operand 95 states. [2019-01-12 11:25:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:38,778 INFO L93 Difference]: Finished difference Result 295 states and 391 transitions. [2019-01-12 11:25:38,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-12 11:25:38,780 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 189 [2019-01-12 11:25:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:38,782 INFO L225 Difference]: With dead ends: 295 [2019-01-12 11:25:38,782 INFO L226 Difference]: Without dead ends: 198 [2019-01-12 11:25:38,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-01-12 11:25:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-12 11:25:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-01-12 11:25:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-12 11:25:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2019-01-12 11:25:38,790 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 189 [2019-01-12 11:25:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:38,790 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2019-01-12 11:25:38,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-12 11:25:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2019-01-12 11:25:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-12 11:25:38,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:38,791 INFO L402 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1, 1, 1] [2019-01-12 11:25:38,792 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1876872438, now seen corresponding path program 46 times [2019-01-12 11:25:38,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:38,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:38,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 2304 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2019-01-12 11:25:40,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:40,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:40,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:40,116 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:40,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:40,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 101 [2019-01-12 11:25:41,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-12 11:25:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-12 11:25:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-01-12 11:25:41,521 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand 101 states. [2019-01-12 11:25:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:42,770 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2019-01-12 11:25:42,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-12 11:25:42,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 197 [2019-01-12 11:25:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:42,773 INFO L225 Difference]: With dead ends: 209 [2019-01-12 11:25:42,773 INFO L226 Difference]: Without dead ends: 205 [2019-01-12 11:25:42,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4800 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-01-12 11:25:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-12 11:25:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-01-12 11:25:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-12 11:25:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2019-01-12 11:25:42,782 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 197 [2019-01-12 11:25:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:42,785 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2019-01-12 11:25:42,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-12 11:25:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2019-01-12 11:25:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-01-12 11:25:42,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:42,787 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1, 1, 1] [2019-01-12 11:25:42,787 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash -538695015, now seen corresponding path program 47 times [2019-01-12 11:25:42,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:42,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:42,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-01-12 11:25:43,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:43,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:44,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-01-12 11:25:44,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:44,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-01-12 11:25:44,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:44,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-12 11:25:44,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 11:25:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 11:25:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:25:44,165 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 52 states. [2019-01-12 11:25:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:44,553 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2019-01-12 11:25:44,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 11:25:44,554 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 203 [2019-01-12 11:25:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:44,557 INFO L225 Difference]: With dead ends: 210 [2019-01-12 11:25:44,557 INFO L226 Difference]: Without dead ends: 206 [2019-01-12 11:25:44,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:25:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-12 11:25:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-01-12 11:25:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-12 11:25:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2019-01-12 11:25:44,563 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 203 [2019-01-12 11:25:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:44,564 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2019-01-12 11:25:44,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 11:25:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2019-01-12 11:25:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-12 11:25:44,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:44,565 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1] [2019-01-12 11:25:44,565 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2057323166, now seen corresponding path program 48 times [2019-01-12 11:25:44,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:44,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:44,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:44,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:44,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-01-12 11:25:46,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:46,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:46,711 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:46,859 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-01-12 11:25:46,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:46,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-01-12 11:25:47,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:47,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-01-12 11:25:47,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-12 11:25:47,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-12 11:25:47,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 11:25:47,101 INFO L87 Difference]: Start difference. First operand 206 states and 256 transitions. Second operand 54 states. [2019-01-12 11:25:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:49,755 INFO L93 Difference]: Finished difference Result 2861 states and 4236 transitions. [2019-01-12 11:25:49,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-12 11:25:49,756 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 205 [2019-01-12 11:25:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:49,766 INFO L225 Difference]: With dead ends: 2861 [2019-01-12 11:25:49,767 INFO L226 Difference]: Without dead ends: 2857 [2019-01-12 11:25:49,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 11:25:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2019-01-12 11:25:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 208. [2019-01-12 11:25:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-12 11:25:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 259 transitions. [2019-01-12 11:25:49,833 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 259 transitions. Word has length 205 [2019-01-12 11:25:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:49,833 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 259 transitions. [2019-01-12 11:25:49,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-12 11:25:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 259 transitions. [2019-01-12 11:25:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-01-12 11:25:49,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:49,839 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1] [2019-01-12 11:25:49,839 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1454796131, now seen corresponding path program 49 times [2019-01-12 11:25:49,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:49,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:49,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:49,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:49,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-01-12 11:25:51,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:51,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-01-12 11:25:51,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 11:25:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 11:25:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:25:51,651 INFO L87 Difference]: Start difference. First operand 208 states and 259 transitions. Second operand 52 states. [2019-01-12 11:25:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:52,450 INFO L93 Difference]: Finished difference Result 307 states and 407 transitions. [2019-01-12 11:25:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 11:25:52,451 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2019-01-12 11:25:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:52,452 INFO L225 Difference]: With dead ends: 307 [2019-01-12 11:25:52,452 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:25:52,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:25:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:25:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:25:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:25:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:25:52,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-01-12 11:25:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:52,455 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:25:52,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 11:25:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:25:52,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:25:52,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:25:53,444 WARN L181 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 407 [2019-01-12 11:25:56,919 WARN L181 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2019-01-12 11:25:56,925 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:25:56,925 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 20) no Hoare annotation was computed. [2019-01-12 11:25:56,925 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 11:25:56,926 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:25:56,926 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:25:56,926 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:25:56,926 INFO L451 ceAbstractionStarter]: At program point L22(lines 10 23) the Hoare annotation is: true [2019-01-12 11:25:56,926 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-01-12 11:25:56,930 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 13 20) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~0 72) (<= 72 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 72)) (<= 72 ULTIMATE.start_main_~x~0)) (and (<= 86 ULTIMATE.start_main_~x~0) (and (<= 86 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 86) (<= ULTIMATE.start_main_~y~0 86))) (and (and (<= 95 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 95) (<= ULTIMATE.start_main_~x~0 95)) (<= 95 ULTIMATE.start_main_~x~0)) (and (and (<= 76 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 76) (<= ULTIMATE.start_main_~y~0 76)) (<= 76 ULTIMATE.start_main_~x~0)) (and (<= 82 ULTIMATE.start_main_~x~0) (and (<= 82 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 82) (<= ULTIMATE.start_main_~x~0 82))) (and (and (<= ULTIMATE.start_main_~y~0 70) (<= ULTIMATE.start_main_~x~0 70) (<= 70 ULTIMATE.start_main_~y~0)) (<= 70 ULTIMATE.start_main_~x~0)) (and (<= 52 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 52) (<= 52 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 52))) (and (<= 87 ULTIMATE.start_main_~x~0) (and (<= 87 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 87) (<= ULTIMATE.start_main_~y~0 87))) (and (<= 81 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 81) (<= ULTIMATE.start_main_~x~0 81) (<= 81 ULTIMATE.start_main_~y~0))) (and (and (<= ULTIMATE.start_main_~y~0 98) (<= 98 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 98)) (<= 98 ULTIMATE.start_main_~x~0)) (and (<= 84 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 84) (<= 84 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 84))) (and (<= 85 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 85) (<= 85 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 85))) (and (and (<= 68 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 68) (<= ULTIMATE.start_main_~y~0 68)) (<= 68 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~y~0 91) (<= 91 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 91)) (<= 91 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~y~0 58) (<= ULTIMATE.start_main_~x~0 58) (<= 58 ULTIMATE.start_main_~y~0)) (<= 58 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~y~0 65) (<= ULTIMATE.start_main_~x~0 65) (<= 65 ULTIMATE.start_main_~y~0)) (<= 65 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~y~0 79) (<= 79 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 79)) (<= 79 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~y~0 88) (<= ULTIMATE.start_main_~x~0 88) (<= 88 ULTIMATE.start_main_~y~0)) (<= 88 ULTIMATE.start_main_~x~0)) (and (<= 99 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 99) (<= 99 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 99))) (and (<= 55 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 55) (<= 55 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 55))) (and (and (<= 93 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 93) (<= ULTIMATE.start_main_~y~0 93)) (<= 93 ULTIMATE.start_main_~x~0)) (and (<= 71 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 71) (<= ULTIMATE.start_main_~x~0 71) (<= 71 ULTIMATE.start_main_~y~0))) (and (<= 89 ULTIMATE.start_main_~x~0) (and (<= 89 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 89) (<= ULTIMATE.start_main_~y~0 89))) (and (<= 59 ULTIMATE.start_main_~x~0) (and (<= 59 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 59) (<= ULTIMATE.start_main_~x~0 59))) (and (and (<= 100 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100)) (<= 100 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 50) (<= ULTIMATE.start_main_~y~0 50) (<= 50 ULTIMATE.start_main_~y~0)) (and (and (<= ULTIMATE.start_main_~x~0 78) (<= 78 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 78)) (<= 78 ULTIMATE.start_main_~x~0)) (and (<= 66 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 66) (<= ULTIMATE.start_main_~x~0 66) (<= 66 ULTIMATE.start_main_~y~0))) (and (<= 57 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~x~0 57) (<= ULTIMATE.start_main_~y~0 57) (<= 57 ULTIMATE.start_main_~y~0))) (and (and (<= ULTIMATE.start_main_~x~0 94) (<= ULTIMATE.start_main_~y~0 94) (<= 94 ULTIMATE.start_main_~y~0)) (<= 94 ULTIMATE.start_main_~x~0)) (and (<= 63 ULTIMATE.start_main_~x~0) (and (<= 63 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 63) (<= ULTIMATE.start_main_~x~0 63))) (and (and (<= 97 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 97) (<= ULTIMATE.start_main_~y~0 97)) (<= 97 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~x~0 74) (<= 74 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 74)) (<= 74 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~x~0 51) (<= ULTIMATE.start_main_~y~0 51) (<= 51 ULTIMATE.start_main_~y~0)) (<= 51 ULTIMATE.start_main_~x~0)) (and (and (<= 64 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 64) (<= ULTIMATE.start_main_~y~0 64)) (<= 64 ULTIMATE.start_main_~x~0)) (and (<= 73 ULTIMATE.start_main_~x~0) (and (<= 73 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 73) (<= ULTIMATE.start_main_~x~0 73))) (and (<= 67 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~x~0 67) (<= 67 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 67))) (and (<= 54 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 54) (<= 54 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 54))) (and (and (<= ULTIMATE.start_main_~y~0 69) (<= 69 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 69)) (<= 69 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~x~0 62) (<= ULTIMATE.start_main_~y~0 62) (<= 62 ULTIMATE.start_main_~y~0)) (<= 62 ULTIMATE.start_main_~x~0)) (and (and (<= 61 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 61) (<= ULTIMATE.start_main_~y~0 61)) (<= 61 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~x~0 53) (<= ULTIMATE.start_main_~y~0 53) (<= 53 ULTIMATE.start_main_~y~0)) (<= 53 ULTIMATE.start_main_~x~0)) (and (<= 60 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~x~0 60) (<= ULTIMATE.start_main_~y~0 60) (<= 60 ULTIMATE.start_main_~y~0))) (and (and (<= ULTIMATE.start_main_~y~0 75) (<= ULTIMATE.start_main_~x~0 75) (<= 75 ULTIMATE.start_main_~y~0)) (<= 75 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~x~0 90) (<= ULTIMATE.start_main_~y~0 90) (<= 90 ULTIMATE.start_main_~y~0)) (<= 90 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~y~0 96) (<= 96 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 96)) (<= 96 ULTIMATE.start_main_~x~0)) (and (and (<= 80 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 80) (<= ULTIMATE.start_main_~y~0 80)) (<= 80 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~x~0 83) (<= ULTIMATE.start_main_~y~0 83) (<= 83 ULTIMATE.start_main_~y~0)) (<= 83 ULTIMATE.start_main_~x~0)) (and (and (<= ULTIMATE.start_main_~y~0 56) (<= ULTIMATE.start_main_~x~0 56) (<= 56 ULTIMATE.start_main_~y~0)) (<= 56 ULTIMATE.start_main_~x~0)) (and (<= 77 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~x~0 77) (<= 77 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 77))) (and (<= 92 ULTIMATE.start_main_~x~0) (and (<= ULTIMATE.start_main_~y~0 92) (<= ULTIMATE.start_main_~x~0 92) (<= 92 ULTIMATE.start_main_~y~0)))) [2019-01-12 11:25:56,930 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:25:56,930 INFO L451 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2019-01-12 11:25:56,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:25:56 BoogieIcfgContainer [2019-01-12 11:25:56,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:25:56,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:25:56,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:25:56,967 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:25:56,968 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:24:34" (3/4) ... [2019-01-12 11:25:56,975 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:25:56,986 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 11:25:56,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:25:57,029 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:25:57,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:25:57,030 INFO L168 Benchmark]: Toolchain (without parser) took 83143.38 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 619.2 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -65.7 MB). Peak memory consumption was 553.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:25:57,031 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:25:57,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:25:57,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.62 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:25:57,035 INFO L168 Benchmark]: Boogie Preprocessor took 28.69 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:25:57,035 INFO L168 Benchmark]: RCFGBuilder took 381.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:25:57,036 INFO L168 Benchmark]: TraceAbstraction took 82359.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 488.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.9 MB). Peak memory consumption was 582.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:25:57,037 INFO L168 Benchmark]: Witness Printer took 63.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:25:57,044 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 41.62 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.69 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 381.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82359.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 488.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.9 MB). Peak memory consumption was 582.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((y <= 72 && 72 <= y) && x <= 72) && 72 <= x) || (86 <= x && (86 <= y && x <= 86) && y <= 86)) || (((95 <= y && y <= 95) && x <= 95) && 95 <= x)) || (((76 <= y && x <= 76) && y <= 76) && 76 <= x)) || (82 <= x && (82 <= y && y <= 82) && x <= 82)) || (((y <= 70 && x <= 70) && 70 <= y) && 70 <= x)) || (52 <= x && (y <= 52 && 52 <= y) && x <= 52)) || (87 <= x && (87 <= y && x <= 87) && y <= 87)) || (81 <= x && (y <= 81 && x <= 81) && 81 <= y)) || (((y <= 98 && 98 <= y) && x <= 98) && 98 <= x)) || (84 <= x && (y <= 84 && 84 <= y) && x <= 84)) || (85 <= x && (y <= 85 && 85 <= y) && x <= 85)) || (((68 <= y && x <= 68) && y <= 68) && 68 <= x)) || (((y <= 91 && 91 <= y) && x <= 91) && 91 <= x)) || (((y <= 58 && x <= 58) && 58 <= y) && 58 <= x)) || (((y <= 65 && x <= 65) && 65 <= y) && 65 <= x)) || (((y <= 79 && 79 <= y) && x <= 79) && 79 <= x)) || (((y <= 88 && x <= 88) && 88 <= y) && 88 <= x)) || (99 <= x && (y <= 99 && 99 <= y) && x <= 99)) || (55 <= x && (y <= 55 && 55 <= y) && x <= 55)) || (((93 <= y && x <= 93) && y <= 93) && 93 <= x)) || (71 <= x && (y <= 71 && x <= 71) && 71 <= y)) || (89 <= x && (89 <= y && x <= 89) && y <= 89)) || (59 <= x && (59 <= y && y <= 59) && x <= 59)) || ((100 <= y && y <= 100) && 100 <= x)) || ((x <= 50 && y <= 50) && 50 <= y)) || (((x <= 78 && 78 <= y) && y <= 78) && 78 <= x)) || (66 <= x && (y <= 66 && x <= 66) && 66 <= y)) || (57 <= x && (x <= 57 && y <= 57) && 57 <= y)) || (((x <= 94 && y <= 94) && 94 <= y) && 94 <= x)) || (63 <= x && (63 <= y && y <= 63) && x <= 63)) || (((97 <= y && x <= 97) && y <= 97) && 97 <= x)) || (((x <= 74 && 74 <= y) && y <= 74) && 74 <= x)) || (((x <= 51 && y <= 51) && 51 <= y) && 51 <= x)) || (((64 <= y && x <= 64) && y <= 64) && 64 <= x)) || (73 <= x && (73 <= y && y <= 73) && x <= 73)) || (67 <= x && (x <= 67 && 67 <= y) && y <= 67)) || (54 <= x && (y <= 54 && 54 <= y) && x <= 54)) || (((y <= 69 && 69 <= y) && x <= 69) && 69 <= x)) || (((x <= 62 && y <= 62) && 62 <= y) && 62 <= x)) || (((61 <= y && x <= 61) && y <= 61) && 61 <= x)) || (((x <= 53 && y <= 53) && 53 <= y) && 53 <= x)) || (60 <= x && (x <= 60 && y <= 60) && 60 <= y)) || (((y <= 75 && x <= 75) && 75 <= y) && 75 <= x)) || (((x <= 90 && y <= 90) && 90 <= y) && 90 <= x)) || (((y <= 96 && 96 <= y) && x <= 96) && 96 <= x)) || (((80 <= y && x <= 80) && y <= 80) && 80 <= x)) || (((x <= 83 && y <= 83) && 83 <= y) && 83 <= x)) || (((y <= 56 && x <= 56) && 56 <= y) && 56 <= x)) || (77 <= x && (x <= 77 && 77 <= y) && y <= 77)) || (92 <= x && (y <= 92 && x <= 92) && 92 <= y) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. SAFE Result, 82.2s OverallTime, 52 OverallIterations, 101 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 730 SDslu, 7791 SDs, 0 SdLazy, 7887 SolverSat, 1965 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7028 GetRequests, 5350 SyntacticMatches, 2 SemanticMatches, 1676 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4800 ImplicationChecksByTransitivity, 47.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=51, 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.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 2660 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 106 NumberOfFragments, 710 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13400 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 11599 NumberOfCodeBlocks, 11525 NumberOfCodeBlocksAsserted, 1489 NumberOfCheckSat, 11498 ConstructedInterpolants, 0 QuantifiedInterpolants, 3781160 SizeOfPredicates, 16 NumberOfNonLiveVariables, 14356 ConjunctsInSsa, 1552 ConjunctsInUnsatCore, 101 InterpolantComputations, 4 PerfectInterpolantSequences, 295786/406427 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...